Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/79630
題名: | Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller | 作者: | Liu, GaiYun;Chao, Daniel Yuh 趙玉 |
貢獻者: | 資管系 | 關鍵詞: | flexible manufacturing system ; Petri net ; deadlock ; siphon ; integer linear programming problem | 日期: | 2015 | 上傳時間: | 10-Dec-2015 | 摘要: | To date, research on the supervisor design for flexible manufacturing systems focuses on speeding up the computation of optimal (maximally permissive) liveness-enforcing controllers. Recent deadlock prevention policies for systems of simple sequential processes with resources (S3PR) reduce the computation burden by considering only the minimal portion of all first-met bad markings (FBMs). Maximal permissiveness is ensured by not forbidding any live state. This paper proposes a method to further reduce the size of minimal set of FBMs to efficiently solve integer linear programming problems while maintaining maximal permissiveness using a vector-covering approach. This paper improves the previous work and achieves the simplest structure with the minimal number of monitors. | 關聯: | International Journal of Control , Volume 88, Issue 8, pages 1423-1428 | 資料類型: | article | DOI: | http://dx.doi.org/10.1080/00207179.2014.991940 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 110 B | HTML2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.