Abstract
A supervisor realized by a finite automaton is called a finite state supervisor. First, the paper shows the equivalence of deterministic and nondeterministic finite state supervisors. Next, it proves a necessary and sufficient condition for the existence of a finite state supervisor. Finally, it shows an example of a supervisor for a nonregular control specification.

This publication has 8 references indexed in Scilit: