Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/72845
DC FieldValueLanguage
dc.contributor資管系
dc.creator趙玉zh_TW
dc.creatorChao, Daniel Yuh
dc.date2007-02
dc.date.accessioned2015-01-12T07:36:22Z-
dc.date.available2015-01-12T07:36:22Z-
dc.date.issued2015-01-12T07:36:22Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/72845-
dc.description.abstractThe proof of liveness for various new classes of nets is not intuitive and rather hard to understand. We propose to find the maximum class, called non-virtual-net (NV-net) that are live as long as all minimal siphons never get empty of tokens and the maximum class, called virtual-net (V-net) that may be weakly live if all minimal siphons never get empty of tokens. In the future, when a new system is developed, if it is an NV-net, then it is live as long as no siphons ever get empty. We show that weakly liveness is closely related to a structure called Virtual First Order Structure. We show that both Synchronized Choice Net and Extended Synchronized Choice Net belong to non-virtual-net.
dc.format.extent551524 bytes-
dc.format.mimetypeapplication/pdf-
dc.relationJournal of Information Science and Engineering,23(2),371-385
dc.subjectPetri nets; synchronized choice nets; siphons; traps; weakly live
dc.titleVirtual First-Order Structure
dc.typearticleen
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextrestricted-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
371-385.pdf538.6 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


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