The supervisory control theory (SCT), also known as the Ramadge–Wonham framework (RW framework), is a method for automatically synthesizing supervisors that restrict the behavior of a plant such that as much as possible of the given specifications are fulfilled. The plant is assumed to spontaneously generate events. The events are in either one of the following two categories controllable or uncontrollable. The supervisor observes the string of events generated by the plant and might prevent the plant from generating a subset of the controllable events. However, the supervisor has no means of forcing the plant to generate an event.
In its original formulation the SCT considered the plant and the specification to be modeled by formal languages, not necessarily
regular languages
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to ...
generated by
finite automata
A finite-state machine (FSM) or finite-state automaton (FSA, plural: ''automata''), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number ...
as was done in most subsequent work.
See also
*
*
References
*
*
* {{cite web , author-first=Luz E. , author-last=Pinzon , title=The Ramadge and Wonham framework , date=1997-10-15 , url=http://rutcor.rutgers.edu/~pinzon/papers/rrr1/node4.html , access-date=2017-10-09 , url-status=live , archive-url=https://web.archive.org/web/20171009185606/http://rutcor.rutgers.edu/~pinzon/papers/rrr1/node4.html , archive-date=2017-10-09
Control theory