| dc.contributor | 資訊管理學系 | zh_Tw |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | zh_TW |
| dc.creator (作者) | Yu, Tsung Hsien | zh_TW |
| dc.creator (作者) | Liou, Chia Chang | zh_TW |
| dc.date (日期) | 2014 | en_US |
| dc.date.accessioned | 17-Aug-2017 15:10:02 (UTC+8) | - |
| dc.date.available | 17-Aug-2017 15:10:02 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Aug-2017 15:10:02 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/112013 | - |
| dc.description.abstract (摘要) | Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and k-th order system which is the simplest class of S3PR (Systems of Simple Sequential Processes with Resources). This paper progresses one step further on enumerating reachable (forbidden, live and deadlock) states for top k-th order systems (one non-sharing resource place in the bottom position of the left-side process, below denoted as Bottom-Left ) with a formula depending on parameter k for a subclass of nets with k sharing resources. | en_US |
| dc.format.extent | 210 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control, ICNSC 2014,572-577 | en_US |
| dc.relation (關聯) | 11th IEEE International Conference on Networking, Sensing and Control, ICNSC 2014; Miami, FL; United States; 7 April 2014 到 9 April 2014; 類別編號CFP14NSC-ART; 代碼 105678 | en_US |
| dc.subject (關鍵詞) | reachability analysis; discrete event systems; Petri nets | en_US |
| dc.title (題名) | Enumeration of reachable, forbidden, live, and deadlock states of bottom k-th order system (with a left side non-sharing resource place) of Petri nets | en_US |
| dc.type (資料類型) | conference | |
| dc.identifier.doi (DOI) | 10.1109/ICNSC.2014.6819689 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ICNSC.2014.6819689 | |
