DocumentCode
1645342
Title
Reachable relation of markings analysis using net unfolding
Author
Shouguang, Wang
Author_Institution
Zhejiang Gongshang Univ., Hangzhou
fYear
2007
Firstpage
685
Lastpage
689
Abstract
Reachable relation of markings analysis using net unfolding. Reachability of states is one of the key problems in the area of discrete event system. Most problems of discrete event system can be reduced to reachability problem. Reachable relation of some markings is discussed in this paper. First a new finite prefix is proposed, and then reachable relation of some configurations is judged based on the finite prefix. Finally, reachable relation of some markings is judged according to reachable relation of some configurations.
Keywords
Petri nets; discrete event systems; reachability analysis; Petri net; discrete event system; finite prefix; markings analysis; net unfolding; reachability; reachable relation; Discrete event systems; Educational institutions; Hydrogen; Information analysis; Petri nets; Discrete event systems; Net unfolding; Petri nets; Reachability;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference, 2007. CCC 2007. Chinese
Conference_Location
Hunan
Print_ISBN
978-7-81124-055-9
Electronic_ISBN
978-7-900719-22-5
Type
conf
DOI
10.1109/CHICC.2006.4347094
Filename
4347094
Link To Document