Synthesis of Maximally Permissive Supervisors for Partially-Observed Discrete-Event Systems

We present new results on the synthesis of safe, non-blocking, and maximally permissive supervisors for partially observed discrete event systems. We consider the case where the legal language is a non-prefix-closed sublanguage of the system language, i.e., non-blockingness must be ensured in addition to safety. To solve this problem, we define a new bipartite transition system, called the Non-blocking All Inclusive Controller (NB-AIC), that embeds all safe and non-blocking supervisors. We present an algorithm for the construction of the NB-AIC and discuss its properties. We obtain the necessary and sufficient conditions for the solvability of the maximally permissive control problem. We then provide a synthesis algorithm, based on the NB-AIC, that constructs a supervisor that is safe, non-blocking and maximally permissive, if one exists. This is the first algorithm with such properties.

[1]  Kemal Inan.  Nondeterministic supervision under partial observations , 1994 .

[2]  Walter Murray Wonham,et al.  On relative coobservability of discrete-event systems , 2015, 2015 American Control Conference (ACC).

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

[4]  R. D. Brandt,et al.  Formulas for calculating supremal controllable and normal sublanguages , 1990 .

[5]  Stéphane Lafortune,et al.  A General Approach for Synthesis of Supervisors for Partially-Observed Discrete-Event Systems , 2014 .

[6]  Jan Komenda,et al.  Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction , 2005, Discret. Event Dyn. Syst..

[7]  Steven I. Marcus,et al.  On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation , 1989, Math. Control. Signals Syst..

[8]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[9]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[10]  Toshimitsu Ushio,et al.  Effective computation of an Lm(G)-closed, controllable, and observable sublanguage arising in supervisory control , 2003, Syst. Control. Lett..

[11]  Feng Lin,et al.  On-line control of partially observed discrete event systems , 1994, Discret. Event Dyn. Syst..

[12]  Stéphane Lafortune,et al.  Solvability of Centralized Supervisory Control Under Partial Observation , 2006, Discret. Event Dyn. Syst..

[13]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..

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

[15]  Shengbing Jiang,et al.  Polynomial synthesis of supervisor for partially observed discrete-event systems by allowing nondeterminism in control , 2005, IEEE Transactions on Automatic Control.

[16]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[17]  Yingping Zheng,et al.  Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage , 1993 .

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

[19]  Stéphane Lafortune,et al.  Synthesis of maximally permissive non-blocking supervisors for partially observed discrete event systems , 2014, 53rd IEEE Conference on Decision and Control.

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

[21]  C. Desclaux,et al.  Supervisory control of discrete-event processes with partial observations , 1988 .