| dc.contributor | 資管系 | zh_Tw |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | en_US |
| dc.creator (作者) | Yu, Tsung Hsien | en_US |
| dc.date (日期) | 2015-06 | en_US |
| dc.date.accessioned | 9-Aug-2017 17:28:27 (UTC+8) | - |
| dc.date.available | 9-Aug-2017 17:28:27 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Aug-2017 17:28:27 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/111695 | - |
| 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 Bottom Left k-net systems (one non-sharing resource place in the Bottom position of the right-side process, below denoted as Bottom-Left-k-net) with a formula depending on parameter k for a subclass of nets with k sharing resources. © 2015 IEEE. | en_US |
| dc.format.extent | 210 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control, 480-485 | en_US |
| dc.subject (關鍵詞) | Control systems; Flexible manufacturing systems; Manufacture; Petri nets; Closed form solutions; Closed-form formulae; Marked graphs; Net systems; Order systems; Sequential process; Sharing resources; Side process; Discrete event simulation | en_US |
| dc.title (題名) | Closed form formula construction to enumerate control related states of Bottom Left k-net S3PR system (with a Bottom Left side non-sharing resource place) of Petri nets | en_US |
| dc.type (資料類型) | conference | - |
| dc.identifier.doi (DOI) | 10.1109/ICNSC.2015.7116084 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ICNSC.2015.7116084 | - |
