Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage

DOI10.1016/0167-6911(93)90082-HzbMath0776.68072OpenAlexW2166174161MaRDI QIDQ1801642

Xiaojun Yang, Jinghuai Fa, Ying-Ping Zheng

Publication date: 1 December 1993

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(93)90082-h

zbMATH Keywords

discrete event systemsupervisory controlregular languagepartial observationcontrollable and observable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Control problems involving ordinary differential equations (34H05) Theory of computing (68Q99)

Related Items

Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication, Maximizing robustness of supervisors for partially observed discrete event systems., Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control

Cites Work

• Unnamed Item
• Formulas for calculating supremal controllable and normal sublanguages
• On observability of discrete-event systems
• On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
• On controllability and normality of discrete event dynamical systems
• Supervisory control of discrete-event processes with partial observations
• Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations