DocumentCode
2577930
Title
A modified reachability tree for Petri nets
Author
Wang, Fei-Yue
Author_Institution
Dept. of Syst. & Ind. Eng., Arizona Univ., Tucson, AZ, USA
fYear
1991
fDate
13-16 Oct 1991
Firstpage
329
Abstract
A modified reachability tree (MRT) for Petri nets which extends the ability of Karp-Miller´s finite reachability tree (FRT) in solving the liveness and reachability problems, and in defining or determining possible firing sequences is given. The finiteness of MRT is proved and several interesting examples are presented to illustrate the difference between MRT and FRT
Keywords
Petri nets; trees (mathematics); Karp-Miller´s finite reachability tree; Petri nets; finiteness; firing sequences; liveness; Fires; Petri nets; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on
Conference_Location
Charlottesville, VA
Print_ISBN
0-7803-0233-8
Type
conf
DOI
10.1109/ICSMC.1991.169706
Filename
169706
Link To Document