Macro liveness graph and liveness of ω-independent unbounded nets

Shou Guang Wang, Meng Di Gan, Meng Chu Zhou

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


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.

Original languageEnglish (US)
JournalScience China Information Sciences
Issue number3
StatePublished - Mar 2015

All Science Journal Classification (ASJC) codes

  • General Computer Science


  • Petri nets
  • complex systems
  • discrete event system (DES)
  • liveness
  • property analysis


Dive into the research topics of 'Macro liveness graph and liveness of ω-independent unbounded nets'. Together they form a unique fingerprint.

Cite this