MLR: A new concept to launch a partial deadlock avoidance policy for k-th order system of Petri Nets

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.