TY - JOUR
T1 - Resource-transition circuits and siphons for deadlock control of automated manufacturing systems
AU - Xing, Keyi
AU - Zhou, Mengchu
AU - Wang, Feng
AU - Liu, Huixia
AU - Tian, Feng
N1 - Funding Information:
Manuscript received June 8, 2009; revised December 4, 2009; accepted February 23, 2010. Date of publication June 21, 2010; date of current version November 10, 2010. This work was supported in part by the National Natural Science Foundation of China under Grants 60774083, 50975224, and 60773001, and the National High Technology Research and Development (863) Program of China under Grant 2008AA04Z109. This paper was recommended by Associate Editor M. P. Fanti.
PY - 2011/1
Y1 - 2011/1
N2 - The resource-transition circuit ( RTC) and siphon are two different structural objects of Petri nets and used to develop deadlock control policies for automated manufacturing systems. They are related to the liveness property of Petri net models and thus used to characterize and avoid deadlocks. Based on them, there are two kinds of methods for developing deadlock controllers. Such methods rely on the computation of all maximal perfect RTCs and strict minimal siphons (SMSs), respectively. This paper concentrates on a class of Petri nets called a system of simple sequential processes with resources, establishes the relation between two kinds of control methods, and identifies maximal perfect RTCs and SMSs. A graph-based technique is used to find all elementary RTC structures. They are then used to derive all RTCs. Next, an iterative method is developed to recursively construct all maximal perfect RTCs from elementary ones. Finally, a one-to-one correspondence between SMSs and maximal perfect RTCs and, hence, an equivalence between two deadlock control methods are established.
AB - The resource-transition circuit ( RTC) and siphon are two different structural objects of Petri nets and used to develop deadlock control policies for automated manufacturing systems. They are related to the liveness property of Petri net models and thus used to characterize and avoid deadlocks. Based on them, there are two kinds of methods for developing deadlock controllers. Such methods rely on the computation of all maximal perfect RTCs and strict minimal siphons (SMSs), respectively. This paper concentrates on a class of Petri nets called a system of simple sequential processes with resources, establishes the relation between two kinds of control methods, and identifies maximal perfect RTCs and SMSs. A graph-based technique is used to find all elementary RTC structures. They are then used to derive all RTCs. Next, an iterative method is developed to recursively construct all maximal perfect RTCs from elementary ones. Finally, a one-to-one correspondence between SMSs and maximal perfect RTCs and, hence, an equivalence between two deadlock control methods are established.
KW - Automated manufacturing system (AMS)
KW - Petri net
KW - controller
KW - deadlock
KW - discrete event systems
KW - resource-transition circuit (RTC)
KW - siphon
UR - http://www.scopus.com/inward/record.url?scp=78349312264&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78349312264&partnerID=8YFLogxK
U2 - 10.1109/TSMCA.2010.2048898
DO - 10.1109/TSMCA.2010.2048898
M3 - Article
AN - SCOPUS:78349312264
SN - 1083-4427
VL - 41
SP - 74
EP - 84
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
M1 - 5491119
ER -