Liveness Analysis of ω-Independent Petri Nets Based on New Modified Reachability Trees
| Autor: | Zhijun Ding, Changjun Jiang, Meiqin Pan, MengChu Zhou, Ru Yang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
0209 industrial biotechnology Computer science Liveness 020207 software engineering 02 engineering and technology Deadlock Process architecture Petri net Omega Graph Computer Science Applications Human-Computer Interaction 020901 industrial engineering & automation Control and Systems Engineering Reachability 0202 electrical engineering electronic engineering information engineering Stochastic Petri net Algorithm design Electrical and Electronic Engineering Software |
| Zdroj: | IEEE Transactions on Systems, Man, and Cybernetics: Systems. :1-12 |
| ISSN: | 2168-2232 2168-2216 |
| DOI: | 10.1109/tsmc.2016.2524062 |
| Popis: | Liveness of Petri nets means all activities in a modeled system can potentially take place and thus implies deadlock freedom. The research on liveness analysis approaches is inadequate. This paper proposes a liveness judgment reachability graph (LJRG) approach to analyze the liveness of $ {\omega }$ -independent Petri nets. Such nets can be loosely explained as a class of unbounded Petri nets in which the changes of tokens in unbounded places are not related to each other. This paper proposes several algorithms to transform a new modified reachability tree to a new modified reachability graph and then transform it to an LJRG. It then develops the application of LJRG into the liveness analysis of $ {\omega }$ -independent unbounded Petri nets. The proposed method provides a new theoretical method and important tool for the liveness analysis of unbounded Petri nets. It is illustrated via some examples. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|