Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes
Extended logical Petri nets are proposed to improve logical Petri nets, and the related firing rules and state reachability graph are introduced. Their attributes, place arrival time, and priority function are defined for each token, batch processing wait time and transition firing duration are defi...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8023751/ |
id |
doaj-d6187ce62546491a964cf8c29ba67cbc |
---|---|
record_format |
Article |
spelling |
doaj-d6187ce62546491a964cf8c29ba67cbc2021-03-29T20:05:13ZengIEEEIEEE Access2169-35362017-01-015168291683910.1109/ACCESS.2017.27431138023751Extended Logical Petri Nets-Based Modeling and Analysis of Business ProcessesWei Liu0https://orcid.org/0000-0001-6468-3232Pin Wang1Yuyue Du2https://orcid.org/0000-0002-5586-109XMengchu Zhou3https://orcid.org/0000-0002-5408-8752Chun Yan4College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, ChinaCollege of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, ChinaCollege of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, ChinaDepartment of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USAThe Renewable Energy Research Group, King Abdulaziz University, Jeddah, Saudi ArabiaExtended logical Petri nets are proposed to improve logical Petri nets, and the related firing rules and state reachability graph are introduced. Their attributes, place arrival time, and priority function are defined for each token, batch processing wait time and transition firing duration are defined for each logical input/output transition, and firing duration is defined for each ordinary transition. Their token removal and generation functions are defined to operate the attributes and arrival time of tokens in places. A state in their reachability graph is redefined. They are used to model an e-commerce system. The reachability, time cost superiority of tokens with different priorities, and fairness of the resulting model are analyzed and correct end-states are illustrated.https://ieeexplore.ieee.org/document/8023751/Extended logical petri netsE-commerce systemsprioritytime |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wei Liu Pin Wang Yuyue Du Mengchu Zhou Chun Yan |
spellingShingle |
Wei Liu Pin Wang Yuyue Du Mengchu Zhou Chun Yan Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes IEEE Access Extended logical petri nets E-commerce systems priority time |
author_facet |
Wei Liu Pin Wang Yuyue Du Mengchu Zhou Chun Yan |
author_sort |
Wei Liu |
title |
Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes |
title_short |
Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes |
title_full |
Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes |
title_fullStr |
Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes |
title_full_unstemmed |
Extended Logical Petri Nets-Based Modeling and Analysis of Business Processes |
title_sort |
extended logical petri nets-based modeling and analysis of business processes |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2017-01-01 |
description |
Extended logical Petri nets are proposed to improve logical Petri nets, and the related firing rules and state reachability graph are introduced. Their attributes, place arrival time, and priority function are defined for each token, batch processing wait time and transition firing duration are defined for each logical input/output transition, and firing duration is defined for each ordinary transition. Their token removal and generation functions are defined to operate the attributes and arrival time of tokens in places. A state in their reachability graph is redefined. They are used to model an e-commerce system. The reachability, time cost superiority of tokens with different priorities, and fairness of the resulting model are analyzed and correct end-states are illustrated. |
topic |
Extended logical petri nets E-commerce systems priority time |
url |
https://ieeexplore.ieee.org/document/8023751/ |
work_keys_str_mv |
AT weiliu extendedlogicalpetrinetsbasedmodelingandanalysisofbusinessprocesses AT pinwang extendedlogicalpetrinetsbasedmodelingandanalysisofbusinessprocesses AT yuyuedu extendedlogicalpetrinetsbasedmodelingandanalysisofbusinessprocesses AT mengchuzhou extendedlogicalpetrinetsbasedmodelingandanalysisofbusinessprocesses AT chunyan extendedlogicalpetrinetsbasedmodelingandanalysisofbusinessprocesses |
_version_ |
1724195354218332160 |