dc.contributor | 資管系 | |
dc.creator (作者) | Chao, Daniel Yuh;Chen, Jiun-Ting | |
dc.creator (作者) | 趙玉;陳俊廷 | zh_TW |
dc.date (日期) | 2011-06 | |
dc.date.accessioned | 8-十月-2015 17:52:33 (UTC+8) | - |
dc.date.available | 8-十月-2015 17:52:33 (UTC+8) | - |
dc.date.issued (上傳時間) | 8-十月-2015 17:52:33 (UTC+8) | - |
dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/78920 | - |
dc.description.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. | |
dc.format.extent | 176 bytes | - |
dc.format.mimetype | text/html | - |
dc.relation (關聯) | Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011,3,論文編號 5952651, 137-141 | |
dc.subject (關鍵詞) | deadlocks; General Petri nets; Hot research topics; Liveness; Sequential process; Sufficient and necessary condition; Synchronized choice nets; weakly live; Computer science; Petri nets | |
dc.title (題名) | A new liveness characterization for S 3PGR 2 | |
dc.type (資料類型) | conference | en |
dc.identifier.doi (DOI) | 10.1109/CSAE.2011.5952651 | |
dc.doi.uri (DOI) | http://dx.doi.org/10.1109/CSAE.2011.5952651 | |