Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/67036
DC FieldValueLanguage
dc.contributor資管系en_US
dc.creator趙玉zh_TW
dc.creatorChao, Daniel Y.en_US
dc.date2011.08en_US
dc.date.accessioned2014-06-30T10:23:09Z-
dc.date.available2014-06-30T10:23:09Z-
dc.date.issued2014-06-30T10:23:09Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/67036-
dc.description.abstractRegion theory can synthesize maximally permissive supervisors by solving a set of inequalities based on the marking/transition-separation instances (MTSIs). It is infeasible to solve these inequalities for either a sizable net or a small net with a sizable initial marking. Huang et al. [1] propose novel crucial MTSIs to reduce the number of MTSIs. Experimental results show that the proposed control policy is the most efficient algorithm among the closely related approaches. One example shows that it not only reaches all live states but also employs fewer control arcs than that by Li et al. Huang et al. offer no hints on why it employs fewer control arcs. This paper develops theory to explain the physics behind.en_US
dc.format.extent284121 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.relationInternational Journal of Advanced Manufacturing Technology., 60(5), 625-629en_US
dc.subjectPetri nets ; Flexible manufacturing system ; Deadlock preventionen_US
dc.titlecomments on Enhancement of an efficient liveness-enforcing supervisor for flexible manufacture systemsen_US
dc.typearticleen
dc.identifier.doi10.1007/s00170-011-3628-4en_US
dc.doi.urihttp://dx.doi.org/10.1007/s00170-011-3628-4en_US
item.openairetypearticle-
item.fulltextWith Fulltext-
item.languageiso639-1en_US-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextrestricted-
item.cerifentitytypePublications-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
625-629.pdf277.46 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


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