Configuration of liveness-enforcing initial marking with the minimum resources for resource allocation systems

Abstract

The enforcement of liveness is crucial for Petri nets models of resource allocation systems (RASs). It is interesting yet very challenging to establish an initial marking for Petri net plants so that the net is live. Such an initial marking is referred to as liveness-enforcing initial marking (LIM). Despite existing literature presenting various LIMs, no studies have addressed the issue of minimizing the number of resources in an LIM. This work focuses on designing an LIM with the minimum resources (LIM-MR) for a class of Petri nets called systems of sequential systems with shared resources (S⁴PRs) by assigning a token capacity to each resource place, such that the sum of all involved resources is minimized. This work first establishes a kind of necessary and sufficient liveness condition for S⁴PR, which is then encoded into a series of variables and constraints in a mixed-integer programming (MIP) formulation. Although LIM-MR may not be unique, solving the proposed MIP formulation can obtain at least one LIM-MR for S⁴PR under consideration. The experimental results show the solvability of this approach for S⁴PRs.