Two generalized-petri-net-based strategies for deadlock prevention in resource allocation systems

This paper considers the deadlock prevention problem for a class of conjunctive/disjunctive resource allocation systems (C/D-RAS) in which multiple resource acquisitions and flexible routings are allowed. The proposed policy is developed in a generalized Petri net framework by an iterative algorithm. Each iteration uses a mixed integer programming (MIP) formulation to find both a bad marking and insufficiently marked siphon. Two new strategies are then presented. One aims to maximize the permissiveness of a liveness-enforcing supervisor while another to minimize the computational and supervisor's complexity. Experimental results validate the effectiveness of these two strategies.