Abstract
This paper proposes a fully expanded tree (FET) approach for one-place-unbounded Petri nets. The FET of a one-place-unbounded Petri net consists of all and only reachable markings from its initial marking. Its applications to liveness and deadlock analysis for such Petri nets are developed. The proposed method has a larger application scope than all the existing methods for them. Several examples are provided to show its superiority over the state-of-the-art methods.
Original language | English (US) |
---|---|
Article number | 7434071 |
Pages (from-to) | 2574-2585 |
Number of pages | 12 |
Journal | IEEE Transactions on Systems, Man, and Cybernetics: Systems |
Volume | 47 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2017 |
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering
Keywords
- Deadlock
- Petri net
- discrete event system
- liveness
- reachability analysis