| dc.contributor | 資訊管理學系 | - |
| dc.creator (作者) | Chao, Daniel Yuh | - |
| dc.creator (作者) | 趙玉 | - |
| dc.date (日期) | 2015-03 | - |
| dc.date.accessioned | 15-Dec-2015 17:57:05 (UTC+8) | - |
| dc.date.available | 15-Dec-2015 17:57:05 (UTC+8) | - |
| dc.date.issued (上傳時間) | 15-Dec-2015 17:57:05 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/79665 | - |
| dc.description.abstract (摘要) | Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs and kth-order systems, which is the simplest class of systems of simple sequential processes with resources. This paper progresses one step further by enumerating reachable, forbidden, live and deadlock states for bottom kth-order systems, which have one non-sharing resource place in the bottom position of the right-side process, with a formula depending on parameter k for a subclass of nets with k sharing resources. | - |
| dc.format.extent | 116 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Transactions of the Institute of Measurement and Control, vol. 37 no. 3 382-395 | - |
| dc.subject (關鍵詞) | Control systems ; discrete event systems ; flexible manufacturing systems | - |
| dc.title (題名) | Computation of control related states of bottom kth-order system (with a non-sharing resource place) of Petri nets | - |
| dc.type (資料類型) | article | - |
| dc.identifier.doi (DOI) | 10.1177/0142331214539989 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1177/0142331214539989 | - |
