A State-Variable Approach for Controlling Discrete Event Systems with Infinite States

In this paper we study suitability of using assignment based programming language for supervisory control of discrete event systems. We first show that the supervisory control problem in its general setting is undecidable. Next we show that the supervisory control problem for discrete event systems modeled by assignment based programs is decidable and develop techniques which reduce the supervisory control problem of such systems to that of solving arithmetic equations. We first apply these techniques for synthesis of static controllers.

[1]  R. Kumar,et al.  Using predicate transformers for supervisory control , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

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

[3]  P. Ramadge,et al.  Modular feedback logic for discrete event systems , 1987 .

[4]  M. Heymann,et al.  On stabilization of discrete-event processes , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

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

[6]  W. Wonham,et al.  Controllability and observability in the state-feedback control of discrete-event systems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[7]  Vijay K. Garg,et al.  On supervisory control of sequential behaviors , 1992 .

[8]  S. Marcus,et al.  On controllability and normality of discrete event dynamical systems , 1991 .