Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/72844
DC FieldValueLanguage
dc.contributor資管系
dc.creator趙玉zh_TW
dc.creatorChao, Daniel Yuh
dc.date2007-05
dc.date.accessioned2015-01-12T07:35:59Z-
dc.date.available2015-01-12T07:35:59Z-
dc.date.issued2015-01-12T07:35:59Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/72844-
dc.description.abstractFor 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.extent529113 bytes-
dc.format.mimetypeapplication/pdf-
dc.relationJournal of Information Science and Engineering,23(3),855-869
dc.subjectPetri nets; siphons; traps; FMS; algorithm; liveness; deadlock
dc.titleSearching Strict Minimal Siphons for SNC-Based Resource Allocation Systems
dc.typearticleen
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextrestricted-
item.openairetypearticle-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
853-867.pdf516.71 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.