Please use this identifier to cite or link to this item:
https://ah.nccu.edu.tw/handle/140.119/78920
|
| Title: | A new liveness characterization for S 3PGR 2 |
| Authors: | Chao, Daniel Yuh;Chen, Jiun-Ting 趙玉;陳俊廷 |
| Contributors: | 資管系 |
| Keywords: | deadlocks;General Petri nets;Hot research topics;Liveness;Sequential process;Sufficient and necessary condition;Synchronized choice nets;weakly live;Computer science;Petri nets |
| Date: | 2011-06 |
| Issue Date: | 2015-10-08 17:52:33 (UTC+8) |
| Abstract: | It has been a hot research topic to find the sufficient and necessary condition of liveness for S 3PGR 2 (systems of simple sequential processes with general resources requirement) modeled by general Petri nets (GPN). This paper proposes a solution. © 2011 IEEE. |
| Relation: | Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011,3,論文編號 5952651, 137-141 |
| Data Type: | conference |
| DOI 連結: | http://dx.doi.org/10.1109/CSAE.2011.5952651 |
| Appears in Collections: | [資訊管理學系] 會議論文 |
Files in This Item:
|
All items in 學術集成 are protected by copyright, with all rights reserved.
| 社群 sharing |