Robust nonblocking supervisory control of discrete-event systems
S.E. Bourdon, Mark Lawford, Walter Murray Wonham
Abstract
S.E. Bourdon, Mark Lawford, Walter Murray Wonham
Abstract
In 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.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In 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.
Key concepts: Sublanguage, Supervisor, Supervisory control, Supervisory control theory, Controllability, Computer science, Event (particle physics), Control (management)