A survey of reachability trees of unbounded Petri nets

Meng Di Gan, Shou Guang Wang, Meng Chu Zhou, Jun Li, Yue Li

Research output: Contribution to journalReview articlepeer-review

9 Scopus citations

Abstract

In recent years both industry and academia have paid much attention to the theory and applications of Petri nets. Reachability is a basic property of a Petri net, and many properties can be analyzed via it. However, analyzing the reachability problem of unbounded Petri nets by finite reachability trees has been an open problem since the inception of Petri nets. Researchers began to study the problem of reachability trees over 40 years ago. However, they made only limited progress over the last 20 years due to its complexity and difficulty. We present an overview of some important contributions toward its solution. The focuses are on four novel finite reachability trees: finite reachability tree (FRT), augmented reachability tree (ART), modified reachability tree (MRT) and new modified reachailbity tree (NMRT). The paper concludes with a discussion of directions for future research of the reachability problem of unbounded Petri nets.

Original languageEnglish (US)
Pages (from-to)686-693
Number of pages8
JournalZidonghua Xuebao/Acta Automatica Sinica
Volume41
Issue number4
DOIs
StatePublished - Apr 1 2015

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Information Systems
  • Computer Graphics and Computer-Aided Design

Keywords

  • Discrete event system
  • Reachability problem
  • Reachability tree
  • Unbounded Petri nets

Fingerprint Dive into the research topics of 'A survey of reachability trees of unbounded Petri nets'. Together they form a unique fingerprint.

Cite this