An Incremental Approach to Extracting Minimal Bad Siphons

Finding all minimal bad siphons is essential for deadlock control. However, the number of siphons grows exponentially with the size of the system. Deadlock occurs due to inappropriate resource sharing. Hence most research focused on the problem of minimal siphon extraction covering a set of places representing resources - an NP-Complete problem for arbitrary Petri Nets. We develop the theory for efficient extraction of minimal bad siphons for S 3 PR (systems of simple sequential processes) proposed by Ezpeleta et al. The number of minimal bad siphons that needs to be searched is linear to the number of resources. The rest can be found by adding and deleting common sets of places from existing ones significantly reducing the search time. It is very interesting that both nets and siphons can be synthesized by first locating a circuit followed by adding handles.

[1]  Daniel Yuh Chao,et al.  Computation of Elementary Siphons in Petri Nets For Deadlock Control , 2006, Comput. J..

[2]  Toshimasa Watanabe,et al.  Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets (Special Section on Concurrent Systems Technology) , 1999 .

[3]  Kamel Barkaoui,et al.  Deadlock avoidance in FMS based on structural theory of Petri nets , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[4]  Daniel Y. Chao,et al.  Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[6]  Daniel Yuh Chao.  Extended Synchronized Choice Nets , 2003, Comput. J..

[7]  Peter Kemper,et al.  Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net , 1993, Application and Theory of Petri Nets.

[8]  Daniel Y. Chao,et al.  Liveness for Synchronized Choice Petri Nets , 2001, Comput. J..

[9]  MuDer Jeng,et al.  ERCN merged nets for modeling degraded behavior and parallel processes in semiconductor manufacturing systems , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[10]  Erwin R. Boer,et al.  Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .

[11]  MengChu Zhou,et al.  Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[12]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[13]  K. Lautenback.  Linear algebraic calculation of deadlocks and traps , 1987 .

[14]  Joaquín Ezpeleta,et al.  Some results on siphon computation for deadlock prevention in resource allocation systems modeled with Petri nets , 2003, EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696).

[15]  Javier Esparza,et al.  Minimal deadlocks in free choice nets , 1989 .

[16]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[17]  Daniel Y. Chao.  Reachability of nonsynchronized choice Petri nets and its applications , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).