The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets
| Autor: | Daniel Yuh Chao, Tsung Hsien Yu |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Computer science Process (computing) 02 engineering and technology State (functional analysis) Petri net Deadlock Net (mathematics) Computer Science Applications Moment (mathematics) 020901 industrial engineering & automation Resource (project management) Control and Systems Engineering 0202 electrical engineering electronic engineering information engineering Resource allocation 020201 artificial intelligence & image processing Algorithm |
| Zdroj: | International Journal of Control. 89:169-178 |
| ISSN: | 1366-5820 0020-7179 |
| DOI: | 10.1080/00207179.2015.1063164 |
| Popis: | Due to the state explosion problem, it has been unimaginable to enumerate reachable states for Petri nets. Chao broke the barrier earlier by developing the very first closed-form solution of the number of reachable and other states for marked graphs and the kth order system. Instead of using first-met bad marking, we propose ‘the moment to launch resource allocation’ (MLR) as a partial deadlock avoidance policy for a large, real-time dynamic resource allocation system. Presently, we can use the future deadlock ratio of the current state as the indicator of MLR due to which the ratio can be obtained real-time by a closed-form formula. This paper progresses the application of an MLR concept one step further on Gen-Left kth order systems (one non-sharing resource place in any position of the left-side process), which is also the most fundamental asymmetric net structure, by the construction of the system's closed-form solution of the control-related states (reachable, forbidden, live and deadlock sta... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|