Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/72844
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | |
dc.creator | 趙玉 | zh_TW |
dc.creator | Chao, Daniel Yuh | |
dc.date | 2007-05 | |
dc.date.accessioned | 2015-01-12T07:35:59Z | - |
dc.date.available | 2015-01-12T07:35:59Z | - |
dc.date.issued | 2015-01-12T07:35:59Z | - |
dc.identifier.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 |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | restricted | - |
item.openairetype | 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.