Symbolic On-the-Fly Synthesis in Supervisory Control Theory

This paper presents an efficient synthesis algorithm and its proof of correctness for computing the controllable, nonblocking, and minimally restrictive supervisor in the supervisory control theory. Conventional synthesis algorithms are based on backward reachability computations, where blocking and uncontrollable states are iteratively found by searching the entire state space several times until a fixed point is reached. Many unnecessary states may be visited in this kind of searching. In this paper, we present an alternative synthesis algorithm based on forward reachability, where a number of synthesis steps are performed during the reachability computations. This approach is inspired from the search techniques in Artificial Intelligence (AI) planning. To handle large-scale problems, the algorithm performs the computations symbolically based on binary decision diagrams. The algorithm has been developed, implemented, and applied to several large-scale benchmarks. It is shown that, on average, the on-the-fly algorithm is more efficient than the conventional synthesis algorithms, in particular for problems with many uncontrollable states.

[1]  R. Malik,et al.  Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems , 2006, 2006 8th International Workshop on Discrete Event Systems.

[2]  Arash Vahidi,et al.  Efficient Analysis of Discrete Event Systems: Supervisor Synthesis with Binary Decision Diagrams , 2004 .

[3]  Guillaume Aucher,et al.  Supervisory control theory in epistemic temporal logic , 2014, AAMAS.

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

[5]  Bengt Lennartson,et al.  Planning transport sequences for flexible manufacturing systems , 2011 .

[6]  Lei Feng,et al.  Computationally efficient supervisor design: abstraction and modularity , 2006, 2006 8th International Workshop on Discrete Event Systems.

[7]  S. Marcus,et al.  On controllability and normality of discrete event dynamical systems , 1991 .

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

[9]  Bengt Lennartson,et al.  A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata , 2012, IEEE Transactions on Control Systems Technology.

[10]  MengChu Zhou,et al.  Design and implementation of a petri net based supervisor for a flexible manufacturing system , 1992, Autom..

[11]  Knut Åkesson,et al.  Modeling sequential resource allocation systems using Extended Finite Automata , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[12]  José E. R. Cury,et al.  Modular Supervisory Control of Large Scale Discrete Event Systems , 2000 .

[13]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[14]  Howard Wong-Toi,et al.  Symbolic Synthesis of Supervisory Controllers , 1992, 1992 American Control Conference.

[15]  W. M. Wonham,et al.  Online supervision of discrete event systems , 2003, Proceedings of the 2003 American Control Conference, 2003..

[16]  B. Lennartson,et al.  Solving two supervisory control benchmark problems using Supremica , 2008, 2008 9th International Workshop on Discrete Event Systems.

[17]  Knut Åkesson,et al.  Modeling of discrete event systems using finite automata with variables , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  Walter Murray Wonham,et al.  On the complexity of supervisory control design in the RW framework , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[19]  P. Ramadge,et al.  On the supremal controllable sublanguage of a given language , 1984, The 23rd IEEE Conference on Decision and Control.

[20]  Walter Murray Wonham,et al.  Nonblocking supervisory control of state tree structures , 2005, IEEE Transactions on Automatic Control.

[21]  J.E.R. Cury,et al.  Testing Modularity of Local Supervisors: An Approach Based on Abstractions , 2006, 2006 8th International Workshop on Discrete Event Systems.

[22]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[23]  Nejib Ben Hadj-Alouane,et al.  Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation , 1996, Discret. Event Dyn. Syst..

[24]  W.M. Wonham,et al.  STSLib and its application to two benchmarks , 2008, 2008 9th International Workshop on Discrete Event Systems.

[25]  W. M. Wonham,et al.  On the consistency of hierarchical supervision in discrete-event systems , 1990 .

[26]  W. M. Wonham,et al.  A structural approach to the non-blocking supervisory control of discrete-event systems , 2009 .

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

[28]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[29]  Bengt Lennartson,et al.  Efficient supervisory synthesis of large systems , 2006 .

[30]  Zhennan Fei,et al.  Symbolic Supervisory Control of Resource Allocation Systems , 2014 .

[31]  Panos J. Antsaklis,et al.  Supervisory Control of Discrete Event Systems Using Petri Nets , 1998, The International Series on Discrete Event Dynamic Systems.

[32]  Bengt Lennartson,et al.  Supervisory control of extended finite automata using transition projection , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[33]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[34]  Bengt Lennartson,et al.  Modelling and PLC-based implementation of modular supervisory control , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[35]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[36]  W. M. Wonham,et al.  State based control of timed discrete event systems using binary decision diagrams , 2007, Syst. Control. Lett..

[37]  Bengt Lennartson,et al.  BDD-based supervisory control on extended finite automata , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[38]  Knut Åkesson,et al.  Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence , 2007, Discret. Event Dyn. Syst..

[39]  Knut Åkesson,et al.  Nonblocking and Safe Control of Discrete-Event Systems Modeled as Extended Finite Automata , 2011, IEEE Transactions on Automation Science and Engineering.

[40]  Nejib Ben Hadj-Alouane,et al.  Variable lookahead supervisory control with state information , 1994 .

[41]  Bengt Lennartson,et al.  Efficient Symbolic Supervisor Synthesis for Extended Finite Automata , 2014, IEEE Transactions on Control Systems Technology.

[42]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[43]  Goran Cengic,et al.  A Control Software Development Method Using IEC 61499 Function Blocks, Simulation and Formal Verification , 2008 .

[44]  Robi Malik,et al.  Compositional synthesis of discrete event systems using synthesis abstraction , 2011, 2011 Chinese Control and Decision Conference (CCDC).

[45]  Peter Norvig,et al.  Artificial intelligence - a modern approach, 2nd Edition , 2003, Prentice Hall series in artificial intelligence.

[46]  Michel Barbeau,et al.  An Efficient Algorithm for Controller Synthesis under Full Observation , 1997, J. Algorithms.

[47]  Rong Su,et al.  Aggregative Synthesis of Distributed Supervisors Based on Automaton Abstraction , 2010, IEEE Transactions on Automatic Control.

[48]  Bengt Lennartson,et al.  Reduced-order synthesis of operation sequences , 2011, ETFA2011.

[49]  Robi Malik,et al.  A Framework for Compositional Synthesis of Modular Nonblocking Supervisors , 2014, IEEE Transactions on Automatic Control.

[50]  Bengt Lennartson,et al.  Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory , 2011, 2011 IEEE International Conference on Robotics and Automation.