Abstract
The concept of controllable language has been shown to play a basic role in the existence theory of supervisory controls for discrete event processes. The supremal controllable sublanguage S of a given language L is characterized as the largest fixpoint of a certain operator OMEGA . 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//j given by K//j// plus //1 equals OMEGA (K//j ), K//0 equals L. An effective computational algorithm is developed, and three examples are provided for illustration.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1073-1080 |
| Number of pages | 8 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| DOIs | |
| State | Published - 1984 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization