Reachability of nonsynchronized choice Petri nets and its applications

A new local structure called a second-order structure was proposed to generate a new class of nets called synchronized choice nets (SNC). SNC covers well-behaved free choice nets. Reachability is no longer P-Space hard problem, but can be solved with polynomial time complexity. How to extend them to non-SNC and its application to deadlock detection in flexible manufacturing systems are discussed.

[1]  Elzbieta Roszkowska.  Supervisory control for deadlock avoidance in compound processes , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  MuDer Jeng,et al.  Synthesis using resource control nets for modeling shared-resource systems , 1995, IEEE Trans. Robotics Autom..

[3]  Zakaria Bouziane,et al.  A primitive recursive algorithm for the general Petri net reachability problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4]  MengChu Zhou,et al.  Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.

[5]  Javier Esparza.  Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete , 1998, Theor. Comput. Sci..

[6]  Kurt Lautenbach,et al.  Liveness in Bounded Petri Nets Which Are Covered by T-Invariants , 1994, Application and Theory of Petri Nets.

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

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

[9]  Joaquín Ezpeleta,et al.  A deadlock avoidance approach for nonsequential resource allocation systems , 2002, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[10]  Luca Ferrarini,et al.  On the Reachability and Reversibility Problems in a Class of Petri Nets , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[11]  D Chao.  Computer-Aided Design (CAD) Technique for Flexible Manufacturing Systems (FMS) Synthesis Utilizing Petri Nets , 2000 .

[12]  Jörg Desel,et al.  Reachability in Cyclic Extended Free-Choice Systems , 1993, Theor. Comput. Sci..

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

[14]  Sadatoshi Kumagai,et al.  Handles and Reachability Analysis of Free Choice Nets , 1995, Application and Theory of Petri Nets.

[15]  MengChu Zhou,et al.  Parallel and sequential mutual exclusions for petri net modeling of manufacturing systems with shared resources , 1991, IEEE Trans. Robotics Autom..

[16]  Atsunobu Ichikawa,et al.  Control of Event-driven Systems , 1985 .

[17]  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).

[18]  Tadashi Matsumoto,et al.  Some useful sufficient criteria for the basic reachability problem in general Petri nets , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[19]  K. Tsuji.  Useful necessary and sufficient condition for reachability of extended marked graphs , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[20]  Aa Twan Basten,et al.  In terms of nets : system design with Petri nets and process algebra , 1998 .

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

[22]  Kunihiko Hiraishi,et al.  A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability is Obtainable , 1988 .

[23]  Alexander E. Kostin,et al.  Reachability analysis in T-invariant-less Petri nets , 2003, IEEE Trans. Autom. Control..

[24]  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.

[25]  Daniel Y. Chao.  Reachability and Firing Sequences of Homogeneous Synchronized Choice Petri Nets , 2005, J. Inf. Sci. Eng..

[26]  MuDer Jeng,et al.  Synthesis using extended resource control nets for modeling shared-resource automated systems , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[27]  Jörg Desel,et al.  Shortest Paths in Reachability Graphs , 1993, J. Comput. Syst. Sci..