Maximally Permissive Robust Supervisors for a Class of Specification Languages

Abstract This paper considers the case that it is only known that the exact model of the plant belongs to a set of possible models. The objective is to synthesize a robust supervisor such that it achieves legal behavior for all possible models. Necessary and sufficient conditions for the existence of a solution to the robust supervisory control problem are derived. When there does not exist a solution, a maximally permissive robust supervisor is synthesized.

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

[2]  Ramavarapu S. Sreenivas.  On asymptotically efficient solutions for a class of supervisory control problems , 1996, IEEE Trans. Autom. Control..

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

[4]  B. H. Krogh,et al.  Design of robust supervisors for discrete event systems with infinite behaviors , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[5]  Feng Lin.  Robust and adaptive supervisory control of discrete event systems , 1993 .

[6]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[7]  Vijay K. Garg,et al.  Model Uncertainty in Discrete Event Systems , 1995 .

[8]  Walter Murray Wonham,et al.  Decentralized supervisory control of discrete-event systems , 1987, Inf. Sci..

[9]  Ratnesh Kumar,et al.  A Discrete Event Systems Approach for Protocol Conversion , 1997, Discret. Event Dyn. Syst..

[10]  W. M. Wonham,et al.  Think globally, act locally: decentralized supervisory control , 1992 .

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

[12]  W. M. Wonham,et al.  Protocol verification using discrete-event systems , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

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