| dc.contributor | 資管系 | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | |
| dc.date (日期) | 2007-02 | |
| dc.date.accessioned | 12-Jan-2015 15:36:22 (UTC+8) | - |
| dc.date.available | 12-Jan-2015 15:36:22 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Jan-2015 15:36:22 (UTC+8) | - |
| dc.identifier.uri (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 |
