Authors
The concept of controllable language has been shown to play a basic role in the existence theory of supervisory controls for discrete event processes. In this paper the supremal controllable sublanguage S of a given language L is characterized as the largest fixpoint of a monotone operator Ω. In the case where the languages involved are regular it is shown that the fixpoint S can be computed as the limit of the (finite) sequence \ Kⱼ \ given by Kj + 1 = Ω (Kⱼ ), K₀ = L. An effective computational algorithm is developed, and three examples are provided for illustration.
No takes yet. Share an insight, caveat, or question.
Wonham et al. (1987) studied this question.