Synthesis of controllers for symmetric systems

This article deals with supervisory control problem for coloured Petri (CP) nets. Considering a CP-net, we build a condensed version of the ordinary state-space, namely the symbolic reachability graph (SRG). This latter graph allows to cope with state-space explosion problem for symmetric systems. The control specification can be expressed in terms of either forbidden states or forbidden sequences of transitions. According to these specifications, we derive the controller by applying the theory of regions on the basis of the SRG. Thanks to expressiveness power of CP-nets, the obtained controller to be connected to the plant model is reduced to one single place.

[1]  Belhassen Zouari,et al.  Synthesis of controllers using symbolic reachability graphs , 2008, 2008 9th International Workshop on Discrete Event Systems.

[2]  Lawrence E. Holloway,et al.  A generalization of state avoidance policies for controlled Petri nets , 1996 .

[3]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .

[4]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

[5]  A. Toguyeni,et al.  A Petri Net based approach for the Synthesis of Parts' Controllers for Reconfigurable Manufacturing Systems , 2006, 2006 SICE-ICASE International Joint Conference.

[6]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[7]  Philippe Darondeau,et al.  Polynomial Algorithms for the Synthesis of Bounded Nets , 1995, TAPSOFT.

[8]  Bruce H. Krogh,et al.  Synthesis of feedback control logic for discrete manufacturing systems , 1991, Autom..

[9]  Belhassen Zouari,et al.  Synthesis of controllers using coloured petri nets and theory of regions , 2004 .

[10]  Michel Barbeau,et al.  Synthesis of Controllers of Processes Modeled as Colored Petri Nets , 1999, Discret. Event Dyn. Syst..

[11]  Alessandro Giua,et al.  Blocking and controllability of Petri nets in supervisory control , 1994, IEEE Trans. Autom. Control..

[12]  Nidhal Rezg,et al.  Design of a live and maximally permissive Petri net controller using the theory of regions , 2003, IEEE Trans. Robotics Autom..

[13]  Belhassen Zouari,et al.  Symbolic Reachability Graph and Partial Symmetries , 1995, Application and Theory of Petri Nets.

[14]  Giovanni Chiola,et al.  A Symbolic Reachability Graph for Coloured Petri Nets , 1997, Theor. Comput. Sci..

[15]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[16]  Carlo Bellettini,et al.  A quotient graph for asymmetric distributed systems , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[17]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[18]  E. Allen Emerson,et al.  From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking , 1999, CHARME.

[19]  Laurent Pautet,et al.  On the Formal Verification of Middleware Behavioral Properties , 2005, Electron. Notes Theor. Comput. Sci..

[20]  R. Sreenivas.  On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets , 1997, IEEE Trans. Autom. Control..

[21]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[22]  Murat Uzam,et al.  An Optimal Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models with Resources and the Theory of Regions , 2002 .

[23]  Alessandro Giua,et al.  A Survey of Petri Net Methods for Controlled Discrete Event Systems , 1997, Discret. Event Dyn. Syst..