| 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-11 | en_US |
| dc.date.accessioned | 9-Aug-2017 17:28:30 (UTC+8) | - |
| dc.date.available | 9-Aug-2017 17:28:30 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Aug-2017 17:28:30 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/111696 | - |
| 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 first step that allows the exponential computation time for reachable states of a particular Petri Net to be reduced within intra-second! Basing on this contribution, instead of by first-met bad marking (FBM), here we propose a new concept to launch a partial deadlock avoidance policy for a large real-time, dynamic resource allocation system: «the moment to launch resource allocation» (MLR). Presently we can use the future ratio of deadlock states of current state as the indicator. © 2015 IEEE. | en_US |
| dc.format.extent | 210 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society, 3148-3152 | en_US |
| dc.subject (關鍵詞) | Control systems; Flexible manufacturing systems; Industrial electronics; Manufacture; Petri nets; Resource allocation; Closed form solutions; Deadlock avoidance; Deadlock state; Dynamic resource allocations; Exponential computation; Marked graphs; Order systems; Real time; Discrete event simulation | en_US |
| dc.title (題名) | MLR: A new concept to launch a partial deadlock avoidance policy for k-th order system of Petri Nets | en_US |
| dc.type (資料類型) | conference | - |
| dc.identifier.doi (DOI) | 10.1109/IECON.2015.7392584 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/IECON.2015.7392584 | - |
