Computation of Control Related States of Middle k-th Order System (with a Nonsharing Resource Place) 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 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 middle even k-th order systems (one non-sharing resource place in the middle position of the right-side process) with a formula depending on parameter k for a subclass of nets with k sharing resources.