DocumentCode
2565295
Title
A method of computing strict minimal siphons in an S3PR based on resource circuits
Author
Wang, ShouGuang ; Wang, ChengYing ; Yu, Yanping
Author_Institution
Coll. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China
fYear
2010
fDate
15-17 Dec. 2010
Firstpage
2785
Lastpage
2790
Abstract
In this paper, a method is proposed to compute all the strict minimal siphons (SMS) in an S3PR based on resource circuits. The concepts of A-resource subsets, B-resource subsets, and elementary B-resource subsets are proposed, which play an important role in finding SMS. Moreover, it is proved in this paper that not all the resource circuits can generate SMS and SMS are generated by elementary B-resource subsets. An FMS example is used to illustrate the application of the proposed method.
Keywords
Petri nets; set theory; A-resource subsets; Petri nets; elementary B-resource subsets; resource circuits; simple sequential processes with resources; strict minimal siphons computation; Computational complexity; Computational efficiency; Finite element methods; Nickel; Petri nets; Strontium; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2010 49th IEEE Conference on
Conference_Location
Atlanta, GA
ISSN
0743-1546
Print_ISBN
978-1-4244-7745-6
Type
conf
DOI
10.1109/CDC.2010.5717027
Filename
5717027
Link To Document