| dc.contributor | 資管系 | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | |
| dc.date (日期) | 2007-05 | |
| dc.date.accessioned | 12-Jan-2015 15:35:59 (UTC+8) | - |
| dc.date.available | 12-Jan-2015 15:35:59 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Jan-2015 15:35:59 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/72844 | - |
| dc.description.abstract (摘要) | 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. | |
| dc.format.extent | 529113 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Journal of Information Science and Engineering,23(3),855-869 | |
| dc.subject (關鍵詞) | Petri nets; siphons; traps; FMS; algorithm; liveness; deadlock | |
| dc.title (題名) | Searching Strict Minimal Siphons for SNC-Based Resource Allocation Systems | |
| dc.type (資料類型) | article | en |
