New reachability trees for unbounded Petri nets

Shouguang Wang, Mengchu Zhou, Mengdi Gan, Dan You, Yue Li

Research output: Contribution to journalConference articlepeer-review

9 Scopus citations


Reachability is an important dynamic property of Petri nets. Its determination given an unbounded net and initial marking has remained an open problem since 1960s. Due to its extreme difficulty, a great deal of research has been focused on some subclasses of unbounded nets. For arbitrary ones, this work intends to propose a new reachability tree (NRT), which consists of only but all reachable markings from its initial marking. Furthermore, an NRT-based method to decide deadlocks of unbounded nets is presented. An example is provided to show the new results.

Original languageEnglish (US)
Article number7139737
Pages (from-to)3862-3867
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Issue numberJune
StatePublished - Jun 29 2015
Event2015 IEEE International Conference on Robotics and Automation, ICRA 2015 - Seattle, United States
Duration: May 26 2015May 30 2015

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering


  • Deadlock
  • Discrete-event system (DES)
  • Petri nets
  • Reachability tree


Dive into the research topics of 'New reachability trees for unbounded Petri nets'. Together they form a unique fingerprint.

Cite this