A modified reachability tree approach to analysis of unbounded Petri nets.

Fei-Yue Wang Fei-Yue Wang,Yanqing Gao Yanqing Gao,Mengchu Zhou

doi:10.1109/tsmcb.2003.811516

A modified reachability tree approach to analysis of unbounded Petri nets.

Fei-Yue Wang Fei-Yue Wang, Yanqing Gao Yanqing Gao + Show 1 more

Open Access

https://doi.org/10.1109/tsmcb.2003.811516

Copy DOI

Journal: IEEE transactions on systems, man, and cybernetics	Publication Date: Feb 1, 2004
Citations: 51	License type: publisher-specific, author manuscript

Affiliation: Shandong Institute of Automation, University of Arizona, New Jersey Institute of Technology

#Reachability Trees #Petri Nets + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text