On the Supremal Controllable Sublanguage of a Given Language

作者： W. M. Wonham , P. J. Ramadge

关键词:

摘要: The concept of controllable language has been shown to play a basic role in the existence theory supervisory controls for discrete event processes. In this paper supremal sublanguage S given L is characterized as largest fixpoint monotone operator $\Omega $. case where languages involved are regular it that can be computed limit (finite) sequence $\{ {K_j } \}$ by $K_{j + 1} = \Omega (K_j )$, $K_0 L$. An effective computational algorithm developed, and three examples provided illustration.