Abstract
Logical Petri Nets (LPNs) can well describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Their structures are simpler than the equivalent inhibition Petri nets. To analyze them, a vector matching method has been given. In this paper a subclass of LPNs is proposed and its properties are analyzed. It can be used to model and simulate e-commerce systems well. Its special structures and relationships among its logical transitions are discussed. Based on them, a reachability tree is constructed and the state equations are used to analyze its properties, that is, reachability, liveness, conservativeness, and reversibility. The proposed analysis method significantly lowers the computational efforts in comparison with the existing method for LPNs.
| Original language | English (US) |
|---|---|
| Article number | 6615917 |
| Pages (from-to) | 468-481 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics: Systems |
| Volume | 44 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2014 |
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering
Keywords
- Discrete event systems
- e-commerce
- logical Petri net (LPN)
- reachability tree
- state equation