Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Improved Controllability Test for Dependent Siphons in S3PR Based on Elementary Siphons
作者 趙玉
Chao,Daniel Y.
貢獻者 資管系
關鍵詞 Petri nets;siphons;controllability;FMS;S3PR
日期 2010.05
上傳時間 11-Nov-2013 15:45:21 (UTC+8)
摘要 When siphons in a flexible manufacturing system (FMS) modeled by an ordinary Petri net (OPN) become unmarked, the net gets deadlocked. To prevent deadlocks, some control places and related arcs are added to strict minimal siphons (SMS) so that no siphon can be emptied. For large systems, it is infeasible to add a monitor to every SMS since the number of SMS or control elements grows exponentially with respect to the size of a Petri net. To tackle this problem, Li and Zhou propose to add control nodes and arcs for only elementary siphons. The rest of siphons, called dependent ones, may be controlled by adjusting control depth variables of elementary siphons associated with a dependent siphon after the failure of two tests. First, they test a Marking Linear Inequality (MLI); if it fails, then they perform a Linear Integer Programming (LIP) test which is an NP-hard problem. This implies that the MLI test is only sufficient, but not necessary. We propose a sufficient and necessary test for adjusting control depth variables in an S3PR to avoid the sufficient-only time-consuming linear integer programming (LIP) test (NP-complete problem) required previously for some cases. We theoretically prove the following: i) no need for LIP test for Type II siphons; and ii) Type I strongly n-dependent (n>2) siphons being always marked. As a result, the total time complexity to check controllability of all strongly dependent siphons is no longer exponential but reduced to linear if all siphons are of Type I. The total time complexity is O(|ΠE||ΠD|) (order of the product of total number of elementary siphons and total number of dependent siphons) if all siphons are of Type II. A well-known S3PR example has been illustrated to show the advantages.
關聯 Asian Journal of Control, 12(3) , 377-391
資料類型 article
DOI http://dx.doi.org/10.1002/asjc.217
dc.contributor 資管系en_US
dc.creator (作者) 趙玉zh_TW
dc.creator (作者) Chao,Daniel Y.-
dc.date (日期) 2010.05en_US
dc.date.accessioned 11-Nov-2013 15:45:21 (UTC+8)-
dc.date.available 11-Nov-2013 15:45:21 (UTC+8)-
dc.date.issued (上傳時間) 11-Nov-2013 15:45:21 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/61579-
dc.description.abstract (摘要) When siphons in a flexible manufacturing system (FMS) modeled by an ordinary Petri net (OPN) become unmarked, the net gets deadlocked. To prevent deadlocks, some control places and related arcs are added to strict minimal siphons (SMS) so that no siphon can be emptied. For large systems, it is infeasible to add a monitor to every SMS since the number of SMS or control elements grows exponentially with respect to the size of a Petri net. To tackle this problem, Li and Zhou propose to add control nodes and arcs for only elementary siphons. The rest of siphons, called dependent ones, may be controlled by adjusting control depth variables of elementary siphons associated with a dependent siphon after the failure of two tests. First, they test a Marking Linear Inequality (MLI); if it fails, then they perform a Linear Integer Programming (LIP) test which is an NP-hard problem. This implies that the MLI test is only sufficient, but not necessary. We propose a sufficient and necessary test for adjusting control depth variables in an S3PR to avoid the sufficient-only time-consuming linear integer programming (LIP) test (NP-complete problem) required previously for some cases. We theoretically prove the following: i) no need for LIP test for Type II siphons; and ii) Type I strongly n-dependent (n>2) siphons being always marked. As a result, the total time complexity to check controllability of all strongly dependent siphons is no longer exponential but reduced to linear if all siphons are of Type I. The total time complexity is O(|ΠE||ΠD|) (order of the product of total number of elementary siphons and total number of dependent siphons) if all siphons are of Type II. A well-known S3PR example has been illustrated to show the advantages.en_US
dc.format.extent 439678 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) Asian Journal of Control, 12(3) , 377-391en_US
dc.subject (關鍵詞) Petri nets;siphons;controllability;FMS;S3PRen_US
dc.title (題名) Improved Controllability Test for Dependent Siphons in S3PR Based on Elementary Siphonsen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1002/asjc.217en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1002/asjc.217en_US