A three-stage deadlock prevention strategy for S3PR nets

In this paper we focus on a particular class of Petri nets, called Systems of Simple Sequential Processes with Resources (S3PR). We propose a deadlock prevention strategy consisting of three stages, and based on Mixed Integer Programming (MIP). The advantage of the proposed approach is a usually higher permissiveness and a lower structural and computational complexity with respect to other approaches. Indeed exhaustive siphon enumeration is not required, as well as reachability analysis. Several numerical examples are illustrated to highlight the effectiveness of the approach.