A reduced reachability tree for a class of unbounded petri nets

Shouguang Wang, Mengdi Gan, Mengchu Zhou, Dan You

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.

Original languageEnglish (US)
Article number7296528
Pages (from-to)345-352
Number of pages8
JournalIEEE/CAA Journal of Automatica Sinica
Volume2
Issue number4
DOIs
StatePublished - Oct 10 2015
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Information Systems
  • Artificial Intelligence

Keywords

  • Petri nets
  • deadlock
  • reachability tree

Fingerprint Dive into the research topics of 'A reduced reachability tree for a class of unbounded petri nets'. Together they form a unique fingerprint.

Cite this