Abstract
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.
Original language | English (US) |
---|---|
Article number | 8023751 |
Pages (from-to) | 16829-16839 |
Number of pages | 11 |
Journal | IEEE Access |
Volume | 5 |
DOIs | |
State | Published - Aug 31 2017 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- General Materials Science
- General Engineering
Keywords
- E-commerce systems
- Extended logical petri nets
- priority
- time