TY - JOUR
T1 - A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets
AU - Wang, Shouguang
AU - Wang, Chengying
AU - Zhou, Mengchu
AU - Li, Zhiwu
N1 - Funding Information:
Manuscript received June 1, 2010; revised November 22, 2010 and April 8, 2011; accepted April 30, 2011. Date of publication July 14, 2011; date of current version December 16, 2011. This work is in part supported by National Natural Science Foundation of China under Grant 61100056, the National Basic Research Program of China (973 Program) under Grant 2011CB302804, the Zhejiang Provincial Natural Science Foundation of China under Grant Y1090232 and Y1100830, the Science Fund for Young Scholars of Zhejiang Gongshang University, and the Zhejiang Provincial Education Department Foundation under Grant Y201018216. This paper was recommended by Associate Editor A. Konar.
PY - 2012/1/1
Y1 - 2012/1/1
N2 - Strict minimal siphons (SMS) play an important role in the development of deadlock control policies for flexible manufacturing systems (FMS). For a class of Petri nets called Systems of Simple Sequential Processes with Resources (S3PR), the resource circuit-based method is an effective way to compute SMS. In this paper, a more effective one to compute SMS is proposed. First, the concepts of loop resource subsets and their characteristic resource subnets are proposed. Next, sufficient and necessary conditions for loop resource subsets to generate SMS are established. Finally, an algorithm is given to find all the SMS based on loop resource subsets. Since the number of loop resource subsets is much less than that of resource circuits and their combinations, the computational efficiency of the SMS enumeration task is significantly improved by the proposed method. An FMS example is used to illustrate the application of the proposed method, and computational time comparisons are provided on several S3PRs to show its superior efficiency.
AB - Strict minimal siphons (SMS) play an important role in the development of deadlock control policies for flexible manufacturing systems (FMS). For a class of Petri nets called Systems of Simple Sequential Processes with Resources (S3PR), the resource circuit-based method is an effective way to compute SMS. In this paper, a more effective one to compute SMS is proposed. First, the concepts of loop resource subsets and their characteristic resource subnets are proposed. Next, sufficient and necessary conditions for loop resource subsets to generate SMS are established. Finally, an algorithm is given to find all the SMS based on loop resource subsets. Since the number of loop resource subsets is much less than that of resource circuits and their combinations, the computational efficiency of the SMS enumeration task is significantly improved by the proposed method. An FMS example is used to illustrate the application of the proposed method, and computational time comparisons are provided on several S3PRs to show its superior efficiency.
KW - Deadlock
KW - Petri net
KW - discrete event system (DES)
KW - flexible manufacturing system (FMS)
KW - supervisory control
UR - http://www.scopus.com/inward/record.url?scp=84655167633&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84655167633&partnerID=8YFLogxK
U2 - 10.1109/TSMCA.2011.2159590
DO - 10.1109/TSMCA.2011.2159590
M3 - Article
AN - SCOPUS:84655167633
SN - 1083-4427
VL - 42
SP - 226
EP - 237
JO - IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans
JF - IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans
IS - 1
ER -