ON THE SUPREMAL CONTROLLABLE SUBLANGUAGE OF A GIVEN LANGUAGE.

W. M. Wonham, P. J. Ramadge

Research output: Contribution to journalConference article

10 Scopus citations

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 languageEnglish (US)
Pages (from-to)1073-1080
Number of pages8
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 1984
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'ON THE SUPREMAL CONTROLLABLE SUBLANGUAGE OF A GIVEN LANGUAGE.'. Together they form a unique fingerprint.

  • Cite this