A modified reachability tree approach to analysis of unbounded Petri nets

Authors:
Fei-Yue Wang;Yanqing Gao;MengChu Zhou
Affiliations:
Complex Syst. & Intelligence Sci. Lab., Chinese Acad. of Sci., Beijing, China;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2004

Citing 0
Cited 2

Automated generation of BPEL adapters

ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
A formalized, taxonomy-driven approach to cross-layer application adaptation

ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms

Quantified Score

Hi-index	0.00

Visualization

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.