Deadlock Prevention Policy for S4PR Nets Based on Siphon

Abstract

Computational efficiency and behavioral permissiveness are important criteria for evaluating the performance of deadlock control strategies. How to achieve an effective tradeoff between these criteria is a hot research topic in the field of deadlock prevention. Toward this end, a new iterative deadlock prevention policy based on mixed integer programming is proposed for a class of Petri nets called systems of sequential systems with shared resources (S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> PR) nets. In each iteration, a minimal bad siphon is first calculated using the new approach, and a monitor is then designed to forbid all S'-bad markings that turn the siphon S into a bad siphon. The algorithm terminates when no bad siphon is detected. The resultant system derived from the proposed approach has more permissive behavior compared with that derived from existing policies. Furthermore, optimal controlled systems can be obtained for some S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> PR nets. Moreover, the computational efficiency of the algorithm is low because computation of the reachability graph and complete siphon enumeration are avoided.