TY - JOUR
T1 - A Modified Reachability Tree Approach to Analysis of Unbounded Petri Nets
AU - Wang, Fei Yue
AU - Gao, Yanqing
AU - Zhou, Meng Chu
N1 - Funding Information:
Manuscript received October 18, 2002; revised February 7, 2003. This work was supported in part by the Oversea Outstanding Talent Program from the State Planning Committee and the Chinese Academy of Sciences, the National Outstanding Young Scientist Research Awards (Class A to F.-Y. Wang and Class B to M.-C. Zhou) from the National Natural Science Foundation of China. This paper was recommended by Associate Editor Narahari.
PY - 2004/2
Y1 - 2004/2
N2 - 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.
AB - 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.
KW - Analysis method
KW - Discrete event systems
KW - Petri nets
KW - Reachability tree
UR - http://www.scopus.com/inward/record.url?scp=0742290028&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0742290028&partnerID=8YFLogxK
U2 - 10.1109/TSMCB.2003.811516
DO - 10.1109/TSMCB.2003.811516
M3 - Article
C2 - 15369073
AN - SCOPUS:0742290028
SN - 1083-4419
VL - 34
SP - 303
EP - 308
JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IS - 1
ER -