Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/72844
題名: | Searching Strict Minimal Siphons for SNC-Based Resource Allocation Systems | 作者: | 趙玉 Chao, Daniel Yuh |
貢獻者: | 資管系 | 關鍵詞: | Petri nets; siphons; traps; FMS; algorithm; liveness; deadlock | 日期: | May-2007 | 上傳時間: | 12-Jan-2015 | 摘要: | For a flexible manufacturing system (FMS) or Resource Allocation System (RAS) which can be decomposed into a number of synchronized choice nets interconnected by resource places, we propose to efficiently extract strict minimal siphons (SMS) in an incremental fashion rather than the traditional global approach. Only a subset of all SMS needs to be searched. The rest SMS can be found by adding and deleting common sets of places from existing ones. | 關聯: | Journal of Information Science and Engineering,23(3),855-869 | 資料類型: | article |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
853-867.pdf | 516.71 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.