DocumentCode
2920119
Title
Petri net based modeling and analysis of switched systems
Author
He, Kevin X. ; Lemmon, Michael D.
Author_Institution
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
fYear
1998
fDate
14-17 Sep 1998
Firstpage
140
Lastpage
145
Abstract
Summarizes results for a class of timed Petri nets called programmable timed Petri nets (PTPN) (Lemon et al., 1988). The application of results concerning the uniform ultimate boundedness of switched systems, modeled by PTPN, is discussed. Unfolding is introduced as an efficient way to identify fundamental cycles from the reachability graph of the PTPN thereby providing an efficient way to test uniform ultimate boundedness of switched systems
Keywords
Petri nets; continuous time systems; discrete event systems; stability; Petri net based analysis; Petri net based modeling; programmable timed Petri nets; reachability graph; switched systems; unfolding; uniform ultimate boundedness; Clocks; Discrete event systems; Helium; Labeling; Logic; Petri nets; Power system modeling; Power system stability; Switched systems; System testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control (ISIC), 1998. Held jointly with IEEE International Symposium on Computational Intelligence in Robotics and Automation (CIRA), Intelligent Systems and Semiotics (ISAS), Proceedings
Conference_Location
Gaithersburg, MD
ISSN
2158-9860
Print_ISBN
0-7803-4423-5
Type
conf
DOI
10.1109/ISIC.1998.713650
Filename
713650
Link To Document