Skip to main content
SpringerLink
Log in

Macro liveness graph and liveness of ω-independent unbounded nets

一类ω独立无界Petri网的活性分析

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Liveness is a basic property of a system and the liveness issue of unbounded Petri nets remains one of the most difficult problems in this field. This work proposes a novel method to decide the liveness of a class of unbounded generalized Petri nets called ω-independent unbounded nets, breaking the existing limits to one-place-unbounded nets. An algorithm to construct a macro liveness graph (MLG) is developed and a critical condition based on MLG deciding the liveness of ω-independent unbounded nets is proposed. Examples are provided to demonstrate its effectiveness.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Liu F C. Polynomial-time verification of diagnosability of fuzzy discrete event systems. Sci China Inf Sci, 2014, 57: 068201(1–10)

    Google Scholar 

  2. Li Z W, Zhou M C. Deadlock Resolution In Automated Manufacturing Systems: A Novel Petri Net Approach. Berlin: Springer, 2009

    Google Scholar 

  3. Jiang J M, Zhang S, Gong P, et al. Modeling and analyzing mixed communications in service-oriented trustworthy software. Sci China Inf Sci, 2012, 55: 2738–2756

    Article  Google Scholar 

  4. Hack M. Decidability Questions for Petri Nets. New York: Garland Publishing, Inc., 1979

    Google Scholar 

  5. Peterson J L. Petri Net Theory and the Modeling of Systems. NJ: Prentice-Hall, 1981

    Google Scholar 

  6. Murata T. Petri nets: Properties, analysis and applications. In: Proceedings of the IEEE, 1989. 77: 541–580

    Article  Google Scholar 

  7. Bourdeaudhuy T, Hanafi S, Yim P. Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. Berlin: Springer, 2004. 112–126

    Google Scholar 

  8. Bourdeaudhuy T, Hanafi S, Yim P. Mathematical programming approach to the Petri nets reachability problem. Euro J Oper Res, 2007, 177: 176–197

    Article  MathSciNet  Google Scholar 

  9. Jones N D, Landweber L H, Edmund L Y. Complexity of some problems in Petri nets. Theor Comp Sci, 1977, 4: 277–299

    Article  MATH  Google Scholar 

  10. Karp R M, Miller R E. Parallel program schemata. J Comp Syst Sci, 1969, 3: 147–195

    Article  MATH  MathSciNet  Google Scholar 

  11. Mayr E W. An algorithm for the general Petri net reachability problem. SIAM J Comp, 1984, 13: 441–460

    Article  MATH  MathSciNet  Google Scholar 

  12. Wang S G, Wang C Y, Zhou M C. Controllability conditions of resultant siphons in a class of Petri nets. IEEE Trans Syst Man Cybern, Part A: Syst Humans, 2012, 42: 1206–1215

    Article  Google Scholar 

  13. Wang S G, Wang C Y, Zhou M C, et al. A method to compute strict minimal siphons in S3PR based on loop resource subsets. IEEE Trans Syst Man Cybern, Part A: Syst Humans, 2012, 42: 226–237

    Article  MATH  Google Scholar 

  14. Jeng M D, Peng M Y. On the liveness problem of 1-place-unbounded Petri nets. In: Proceedings of the International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, Orlando, 1997. 3221–3226

    Google Scholar 

  15. Jeng M D, Peng M Y. Augmented reachability trees for 1-place-unbounded generalized Petri nets. IEEE Trans Syst Man Cybern, Part A: Syst Humans, 1999, 29: 173–183

    Article  Google Scholar 

  16. Wang F Y, Gao Y Q, Zhou M C. A modified reachability tree approach to analysis of unbounded Petri nets. IEEE Trans Syst Man Cybern, Part B: Cybernetics, 2004, 34: 303–308

    Article  Google Scholar 

  17. Wang F Y. A modified reachability tree for Petri nets. In: Proceedings of the International Conference on Systems, Man, and Cybernetics, Charlottesville, 1991. 329–334

    Google Scholar 

  18. Wong H M, Zhou M C. Automated generation of modified reachability trees for Petri nets. In: Proceedings of the Regional Control Conference, Brooklyn, 1992. 119–121

    Google Scholar 

  19. Ru Y, Wu W, Hadjicostis C N. Comments on a modified reachability tree approach to analysis of unbounded Petri Nets. IEEE Trans Syst Man Cybern, Part B: Cybernetics, 2006, 36: 1210–1210

    Article  Google Scholar 

  20. Ding Z J, Jiang C J, Zhou M C. Deadlock checking for one-place unbounded Petri nets based on modified reachability trees. IEEE Trans Syst Man Cybern, Part B: Cybernetics, 2008, 38: 881–883

    Article  Google Scholar 

  21. Wang Y, Jiang B, Jiao L. Property checking for 1-place-unbounded Petri nets. In: Proceedings of IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE), Taibei, 2010. 117–125

    Google Scholar 

  22. Wang S G, Zhou M C, Li Z W, et al. A new modified reachability tree approach and its applications to unbounded Petri nets. IEEE Trans Syst Man Cybern, Part A: Syst Humans, 2013, 43: 932–940

    Article  Google Scholar 

  23. West D B. Introduction to graph theory. N.J.: Prentice Hall, 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, 310018, China

    ShouGuang Wang

  2. Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai, 201804, China

    MengDi Gan & MengChu Zhou

  3. Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    MengChu Zhou

Authors
  1. ShouGuang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. MengDi Gan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. MengChu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to ShouGuang Wang or MengChu Zhou.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, S., Gan, M. & Zhou, M. Macro liveness graph and liveness of ω-independent unbounded nets. Sci. China Inf. Sci. 58, 1–10 (2015). https://doi.org/10.1007/s11432-014-5239-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-014-5239-9

Keywords

关键词

Search

Navigation