Supervisory Control of Discrete-Event Systems via IC3

The IC3 algorithm has proven to be an effective SAT-based safety model checker. It has been generalized to other frameworks such as SMT and applied very successfully to hardware and software model checking. In this paper, we present a novel technique for the supervisory control of discrete-event systems with infinite state space via IC3. We introduce an algorithm for synthesizing maximally permissive controllers using a generalized IC3 to find (if any exists) a weakest inductive invariant predicate which holds in the initial state, is maintained as the system evolves, and implies safety and control properties. To this end, we use a variation of IC3, called Tree-IC3, as a bug finder to solve the supervisory predicate control problem by iteratively reporting all feasible counterexample traces using a tree-like search, while controlling the system to avoid them. The maximally permissiveness is achieved by finding the weakest of such controllers that is invariant under safety and control properties. Experimental results demonstrate the great potential of using IC3 technique for the purpose of the supervisory control problems.

[1]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

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

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

[4]  Nikolaj Bjørner,et al.  Generalized Property Directed Reachability , 2012, SAT.

[5]  Walter Murray Wonham,et al.  Hierarchical interface-based supervisory control-part II: parallel case , 2005, IEEE Transactions on Automatic Control.

[6]  Kenneth L. McMillan,et al.  Lazy Abstraction with Interpolants , 2006, CAV.

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

[8]  Thomas A. Henzinger,et al.  Lazy abstraction , 2002, POPL '02.

[9]  F. Lin,et al.  Modeling of discrete event systems using finite state machines with parameters , 2000, Proceedings of the 2000. IEEE International Conference on Control Applications. Conference Proceedings (Cat. No.00CH37162).

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

[11]  P. Ramadge,et al.  Modular feedback logic for discrete event systems , 1987 .

[12]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[13]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[14]  Andrei Voronkov,et al.  Interpolation and Symbol Elimination in Vampire , 2010, IJCAR.

[15]  Fabio Somenzi,et al.  IC3: Where monolithic and incremental meet , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

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

[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]  Alberto Griggio,et al.  Software Model Checking via IC3 , 2012, CAV.

[19]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[20]  Klaus Schneider,et al.  Solving Games Using Incremental Induction , 2013, IFM.

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  Bengt Lennartson,et al.  A symbolic approach to large-scale discrete event systems modeled as finite automata with variables , 2012, 2012 IEEE International Conference on Automation Science and Engineering (CASE).

[23]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[24]  Robert K. Brayton,et al.  Efficient implementation of property directed reachability , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[25]  Fabio Somenzi,et al.  Incremental, Inductive CTL Model Checking , 2012, CAV.

[26]  Aaron R. Bradley,et al.  SAT-Based Model Checking without Unrolling , 2011, VMCAI.

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

[28]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[29]  Mary Sheeran,et al.  SAT-Solving in Practice, with a Tutorial Example from Supervisory Control , 2009, Discret. Event Dyn. Syst..

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

[31]  Peyman Gohari,et al.  Embedded supervisory control of discrete-event systems , 2005, IEEE International Conference on Automation Science and Engineering, 2005..

[32]  Alessandro Cimatti,et al.  Theory and Applications of Satisfiability Testing – SAT 2012 , 2012, Lecture Notes in Computer Science.

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