Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/75281
題名: | Structure of weakly 2-dependent siphons | 作者: | Chao, Daniel Yuh;Chen, Jiun-Ting 趙玉;陳俊廷 |
貢獻者: | 資管系 | 關鍵詞: | Complementary sets; Complete problems; Elementary siphon; Linear integer programming; Nondeterministic polynomial; Optimal sequence; Resource requirements; Sequential process; Flexible manufacturing systems; Integer programming; Petri nets; Structural optimization; Siphons | 日期: | Sep-2013 | 上傳時間: | 21-May-2015 | 摘要: | Deadlocks arising from insufficiently marked siphons in flexible manufacturing systems can be controlled by adding monitors to each siphon-too many for large systems. Li and Zhou add monitors to elementary siphons only while controlling the rest of (called dependent) siphons by adjusting control depth variables of elementary siphons. Only a linear number of monitors are required. The control of weakly dependent siphons (WDSs) is rather conservative since only positive terms were considered. The structure for strongly dependent siphons (SDSs) has been studied earlier. Based on this structure, the optimal sequence of adding monitors has been discovered earlier. Better controllability has been discovered to achieve faster and more permissive control. The results have been extended earlier to S3PGR2 (systems of simple sequential processes with general resource requirements). This paper explores the structures for WDSs, which, as found in this paper, involve elementary resource circuits interconnecting at more than (for SDSs, exactly) one resource place. This saves the time to compute compound siphons, their complementary sets and T-characteristic vectors. Also it allows us (1) to improve the controllability of WDSs and control siphons and (2) to avoid the time to find independent vectors for elementary siphons. We propose a sufficient and necessary test for adjusting control depth variables in S3PR (systems of simple sequential processes with resources) to avoid the sufficient-only time-consuming linear integer programming test (LIP) (Nondeterministic Polynomial (NP) time complete problem) required previously for some cases. © 2013 Taylor & Francis. | 關聯: | International Journal of Control, 86(9), 1518-1533 | 資料類型: | article | DOI: | http://dx.doi.org/10.1080/00207179.2013.787692 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 176 B | HTML2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.