DocumentCode
622580
Title
A new reachability tree for unbounded Petri nets
Author
Yue Li ; ShouGuang Wang ; Jing Yang
Author_Institution
Sch. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China
fYear
2013
fDate
12-14 June 2013
Firstpage
1296
Lastpage
1301
Abstract
Petri nets can be viewed as graphical models and mathematical tools to study discrete event system. As a basic analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics. In this paper, a new reachability tree for unbounded generalized Petri nets is proposed. This new method can decrease the number of nodes in the new reachability tree besides avoidance of some spurious markings which appear in other reachability trees. Several examples are provided to illustrate its superiority.
Keywords
Petri nets; reachability analysis; trees (mathematics); discrete event system; graphical models; mathematical tools; reachability tree; unbounded generalized Petri nets; Discrete-event systems; Educational institutions; Firing; Petri nets; Solids; Subspace constraints; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Automation (ICCA), 2013 10th IEEE International Conference on
Conference_Location
Hangzhou
ISSN
1948-3449
Print_ISBN
978-1-4673-4707-5
Type
conf
DOI
10.1109/ICCA.2013.6565008
Filename
6565008
Link To Document