DocumentCode :
2662973
Title :
Reachability of LSFC nets
Author :
Lee, Dong Ik ; Kumagai, Sadatoshi ; Kodama, Shinzo
Author_Institution :
Dept. of Electron. Eng., Osaka Univ., Japan
fYear :
1990
fDate :
1-3 May 1990
Firstpage :
2666
Abstract :
Free choice nets are a class of Petri nets that can represent the substantial features of systems by modeling both choice and concurrency. A reachability problem of live and safe free choice (LSFC) nets is considered. A necessary and sufficient condition for the reachability of a class of LSFC nets is presented. A structural analysis of LSFC nets is presented
Keywords :
Petri nets; LSFC nets; Petri nets; choice; concurrency; live and safe free choice; reachability problem; structural analysis; Character recognition; Communication systems; Concurrent computing; Control system synthesis; Discrete event systems; Flexible manufacturing systems; Petri nets; Power engineering and energy; Power system modeling; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location :
New Orleans, LA
Type :
conf
DOI :
10.1109/ISCAS.1990.112557
Filename :
112557
Link To Document :
بازگشت