Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence

This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence. In this context, a large number of ways are suggested how a finite-state automaton can be simplified such that the results of supervisor synthesis are preserved. The proposed approach yields a compact representation of a least restrictive supervisor that ensures controllability and nonblocking. The method is demonstrated on a simple manufacturing example to significantly reduce the number of states constructed for supervisor synthesis.

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

[2]  Walter Murray Wonham,et al.  Modular Control and Coordination of Discrete-Event Systems , 1998, Discret. Event Dyn. Syst..

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

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Martin Fabian.  On Object Oriented Nondeterministic Supervisory Control , 1995 .

[6]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[7]  Raoguang Song,et al.  Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control , 2006, 2006 8th International Workshop on Discrete Event Systems.

[8]  D.M. Tilbury,et al.  Modular Supervisory Control of Discrete-Event Systems with Abstraction and Incremental Hierarchical Construction , 2006, 2006 8th International Workshop on Discrete Event Systems.

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

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

[11]  H. Flordal,et al.  Supervision equivalence [supervisor synthesis] , 2006, 2006 8th International Workshop on Discrete Event Systems.

[12]  W. M. Wonham,et al.  Decentralized control and coordination of discrete-event systems with partial observation , 1990 .

[13]  Robi Malik,et al.  Incremental verification and synthesis of discrete-event systems guided by counter examples , 2004, IEEE Transactions on Control Systems Technology.

[14]  José Eduardo Ribeiro Cury,et al.  Multitasking Supervisory Control of Discrete-Event Systems , 2005, Discret. Event Dyn. Syst..

[15]  W. M. Wonham,et al.  Supervisor Reduction for Discrete-Event Systems , 2004, Discret. Event Dyn. Syst..

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

[17]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[18]  Robi Malik,et al.  Conflicts and Fair Testing , 2006, Int. J. Found. Comput. Sci..

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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