On Computation of Resource Circuits in a Class of Petri Nets

In recent years, strict minimal siphons (SMS) play an important role in the development of deadlock prevention policies for FMS and the methods based on resource circuits have become a research hotspot in the field of deadlock control. For a class of Petri nets called (SPR)-P-3, this paper proposes an effective method to compute all the resource circuits. When the proposed method is used in deadlock prevention policies, the computational complexity can be significantly reduced, thereby decreasing control implementation complexity and cost. An FMS example is used to illustrate the application of the proposed method.