A Modified Reachability Tree Approach to Analysis of Unbounded Petri Nets

Fei Yue Wang, Yanqing Gao, Meng Chu Zhou

Research output: Contribution to journalArticlepeer-review

46 Scopus citations


Reachability trees, especially the corresponding Karp-Miller's finite reachability trees generated for Petri nets are fundamental for systematically investigating many characteristics such as boundedness, liveness, and performance of systems modeled by Petri nets. However, too much information is lost in a FRT to render it useful for many applications. In this paper, modified reachability trees (MRT) of Petri nets are introduced that extend the capability of Karp-Miller's FRTs in solving the liveness, deadlock, and reachability problems, and in defining or determining possible firing sequences. The finiteness of MRT is proved and several examples are presented to illustrate the advantages of MRT over FRT.

Original languageEnglish (US)
Pages (from-to)303-308
Number of pages6
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Issue number1
StatePublished - Feb 2004

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Information Systems
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering


  • Analysis method
  • Discrete event systems
  • Petri nets
  • Reachability tree


Dive into the research topics of 'A Modified Reachability Tree Approach to Analysis of Unbounded Petri Nets'. Together they form a unique fingerprint.

Cite this