Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/72845
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | |
dc.creator | 趙玉 | zh_TW |
dc.creator | Chao, Daniel Yuh | |
dc.date | 2007-02 | |
dc.date.accessioned | 2015-01-12T07:36:22Z | - |
dc.date.available | 2015-01-12T07:36:22Z | - |
dc.date.issued | 2015-01-12T07:36:22Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/72845 | - |
dc.description.abstract | The 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.extent | 551524 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | Journal of Information Science and Engineering,23(2),371-385 | |
dc.subject | Petri nets; synchronized choice nets; siphons; traps; weakly live | |
dc.title | Virtual First-Order Structure | |
dc.type | article | en |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | restricted | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
371-385.pdf | 538.6 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.