Symbolic reachability computation using the disjunctive partitioning technique 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 a given specification is fulfilled. A problem, which prevents SCT from having a major breakthrough industrially, is that the supervisory synthesis often 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 efficient symbolic state-space traversal approach, depending on the disjunctive partitioning technique, is presented and the correctness of it is proved. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.

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

[2]  Claude E. Shannon,et al.  The Mathematical Theory of Communication , 1950 .

[3]  J. Schiff.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

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

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

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

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

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

[9]  Knut Åkesson,et al.  Supremica - A Tool for Verification and Synthesis of Discrete Event Supervisors , 2003 .

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

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

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

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

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

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

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

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

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

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

[20]  Bengt Lennartson,et al.  Efficient Symbolic Supervisory Synthesis and Guard Generation - Evaluating Partitioning Techniques for the State-space Exploration , 2011, ICAART.

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