Symbolic State-Space Exploration and Guard Generation in Supervisory Control Theory

Supervisory Control Theory (SCT) is a model-based framework for automatically synthesizing a supervisor that minimally restricts the behavior of a plant such that given specifications is fulfilled. The main obstacle which prevents SCT from having a major industrial breakthrough is that the supervisory synthesis, consisting of a series of reachability tasks, suffers from the state-space explosion problem. To alleviate this problem, a well-known strategy is to represent and explore the state-space symbolically by using Binary Decision Diagrams. Based on this principle, an alternative symbolic state-space traversal approach, depending on the disjunctive partitioning technique, is presented in this paper. In addition, the approach is adapted to the prior work, the guard generation procedure, to extract compact propositional formulae from a symbolically represented supervisor. These propositional formulae, referred to as guards, are then attached to the original model, resulting in a modular and comprehensible representation of the supervisor.

[1]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Edmund M. Clarke,et al.  Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.

[3]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[4]  Claude E. Shannon,et al.  A mathematical theory of communication , 1948, MOCO.

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

[6]  Bengt Lennartson,et al.  Automatic generation of controllers for collision-free flexible manufacturing systems , 2010, 2010 IEEE International Conference on Automation Science and Engineering.

[7]  Bengt Lennartson,et al.  Efficient supervisory synthesis of large systems , 2004 .

[8]  B. Lennartson,et al.  Efficient reachability analysis on modular discrete-event systems using binary decision diagrams , 2006, 2006 8th International Workshop on Discrete Event Systems.

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

[10]  B. Lennartson,et al.  Extraction and representation of a supervisor using guards in extended finite automata , 2008, 2008 9th International Workshop on Discrete Event Systems.

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

[12]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[13]  Bruce H. Krogh,et al.  Synthesis of feedback control logic for a class of controlled Petri nets , 1990 .

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

[15]  Lei Feng,et al.  Designing communicating transaction processes by supervisory control theory , 2007, Formal Methods Syst. Des..

[16]  Mark Lawford,et al.  Hierarchical interface-based supervisory control: serial case , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[17]  Ryan J. Leduc,et al.  Hierarchical Interface-based Supervisory Control , 2003 .

[18]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[19]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

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

[21]  S. Balemi,et al.  Supervisory control of a rapid thermal multiprocessor , 1993, IEEE Trans. Autom. Control..

[22]  Igor L. Markov,et al.  FORCE: a fast and easy-to-implement variable-ordering heuristic , 2003, GLSVLSI '03.