Robust Nonblocking Supervisory Control of Discrete-Event Systems

Sean E. Bourdon

Mark Lawford

W. Murray Wonham


In the first part of this paper, we generalize a notion of robust supervisory control to deal with marked languages. We show how to synthesize a supervisor to control a family of plant models, each with its own specification. The solution we obtain is the most general in that it provides the closest approximation to the supremal controllable sublanguage for each plant/specification pair. The second part of this paper extends these results to deal with timed discrete-event systems.