| dc.contributor | 資管系 | |
| dc.creator (作者) | Liu, GaiYun;Chao, Daniel Yuh | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.date (日期) | 2015 | |
| dc.date.accessioned | 10-Dec-2015 16:16:35 (UTC+8) | - |
| dc.date.available | 10-Dec-2015 16:16:35 (UTC+8) | - |
| dc.date.issued (上傳時間) | 10-Dec-2015 16:16:35 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/79630 | - |
| dc.description.abstract (摘要) | 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. | |
| dc.format.extent | 110 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | International Journal of Control , Volume 88, Issue 8, pages 1423-1428 | |
| dc.subject (關鍵詞) | flexible manufacturing system ; Petri net ; deadlock ; siphon ; integer linear programming problem | |
| dc.title (題名) | Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1080/00207179.2014.991940 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1080/00207179.2014.991940 | |
