Supervisory Control with Partial Observations

DOI10.1007/978-1-4471-4276-8_4zbMath1304.93015OpenAlexW419845083MaRDI QIDQ5496922

Jan Komenda

Publication date: 29 January 2015

Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4471-4276-8_4

Mathematics Subject Classification ID

Hierarchical systems (93A13) Discrete event control/observation systems (93C65) Cellular automata (computational aspects) (68Q80)

Cites Work

• Formulas for calculating supremal controllable and normal sublanguages
• Control of discrete-event systems with partial observations using coalgebra and coinduction
• On observability of discrete-event systems
• On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
• On the control of discrete-event dynamical systems
• The infimal prefix-closed and observable superlanguage of a given language
• Decentralized supervisory control of discrete-event systems
• Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
• On computation of supremal controllable, normal sublanguages
• On the definition of a family of automata
• Introduction to Discrete Event Systems
• Supervisory control of discrete-event processes with partial observations
• M -controllable subpredicates arising in state feed back control of discrete event systems
• Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
• The computational complexity of decentralized discrete-event control problems
• Computer Aided Verification

This page was built for publication: Supervisory Control with Partial Observations