Decentralized Control of Infinite Systems

We propose algorithms for the synthesis of decentralized state-feedback controllers with partial observation of infinite state systems, which are modeled by Symbolic Transition Systems. We first consider the computation of safe controllers ensuring the avoidance of a set of forbidden states and then extend this result to the deadlock free case. The termination of the algorithms solving these problems is ensured by the use of abstract interpretation techniques, but at the price of overapproximations, in particular, in the computation of the states which must be avoided. We then extend our algorithms to the case where the system to be controlled is given by a collection of subsystems (modules). This structure is exploited to locally compute a controller for each module. Our tool SMACS gives an empirical evaluation of our methods by showing their feasibility, usability and efficiency.

[1]  W. M. Wonham,et al.  Modular supervisory control of discrete-event systems , 1988, Math. Control. Signals Syst..

[2]  P. Ramadge,et al.  Modular Supervisory Control of Discrete Event Systems , 1988 .

[3]  Vijay K. Garg,et al.  On computation of state avoidance control for infinite state systems in assignment program framework , 2005, IEEE Transactions on Automation Science and Engineering.

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

[5]  Ilya V. Kolmanovsky,et al.  Predictive energy management of a power-split hybrid electric vehicle , 2009, 2009 American Control Conference.

[6]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[7]  R. Malik,et al.  Incremental system verification and synthesis of minimally restrictive behaviours , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[8]  Knut Åkesson,et al.  Exploiting Modularity for Synthesis and Verification of Supervisors , 2002 .

[9]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

[11]  Hervé Marchand,et al.  An Efficient Modular Method for the Control of Concurrent Discrete Event Systems: A Language-based Approach , 2007, Discret. Event Dyn. Syst..

[12]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[13]  Shigemasa Takai,et al.  M -controllable subpredicates arising in state feed back control of discrete event systems , 1997 .

[14]  Bertrand Jeannet,et al.  Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems , 2003, Formal Methods Syst. Des..

[15]  T. Ushio,et al.  Decentralized state feedback control of discrete event systems , 1994 .

[16]  Tristan Le Gall,et al.  Supervisory Control of Infinite Symbolic Systems using Abstract Interpretation , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[17]  Wojciech Rytter,et al.  Automata-theoretic approach , 2002 .

[18]  Antoine Miné,et al.  The octagon abstract domain , 2001, Proceedings Eighth Working Conference on Reverse Engineering.

[19]  Hervé Marchand,et al.  EFFICIENT COMPUTATION OF SUPERVISORS FOR LOOSELY SYNCHRONOUS DISCRETE EVENT SYSTEMS: A STATE-BASED APPROACH , 2005 .

[20]  Shigemasa Takai.  On the language generated under fully decentralized supervision , 1998 .

[21]  B. Gaudin,et al.  Supervisory Control on Concurrent Discrete Event Systems with Variables , 2007, 2007 American Control Conference.

[22]  Antoine Mid.  The Octagon Abstract Domain , 2001 .

[23]  Vijay K. Garg,et al.  Predicates and predicate transformers for supervisory control of discrete event dynamical systems , 1993, IEEE Trans. Autom. Control..

[24]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[25]  Shigemasa Takai,et al.  Characterization of all M-controllable subpredicates of a given predicate , 1998 .

[26]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems, Second Edition , 2008 .

[27]  W. Murray Wonham,et al.  Think Globally, Act Locally: Decentralized Supervisory Control , 1991, 1991 American Control Conference.

[28]  Rong Su,et al.  Supervisory control of concurrent discrete-event systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[29]  Bertrand Jeannet,et al.  Symbolic Test Selection Based on Approximate Analysis , 2005, TACAS.

[30]  Thierry Massart,et al.  Control of infinite Symbolic Transition Systems under partial observation , 2009, 2009 European Control Conference (ECC).

[31]  Nicolas Halbwachs,et al.  Verification of Real-Time Systems using Linear Relation Analysis , 1997, Formal Methods Syst. Des..

[32]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[33]  JeannetB..  Dynamic Partitioning in Linear Relation Analysis , 2003 .

[34]  Michael Heymann,et al.  Supervisory control of concurrent discrete-event systems , 1991 .

[35]  Stéphane Lafortune,et al.  A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems , 2002, Discret. Event Dyn. Syst..