On the complexity of synthesizing a minimum-weighted supervisor under partial observation
From MaRDI portal
Publication:458885
DOI10.1016/j.automatica.2014.04.009zbMath1296.93003OpenAlexW1997056479MaRDI QIDQ458885
Publication date: 8 October 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2014.04.009
controllabilitynormalitysupervisor synthesisweighted automatanatural observerNP-completeness/hardness
Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Hierarchical systems (93A13) Observability (93B07)
Related Items
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- On observability of discrete-event systems
- On optimal attraction in discrete-event processes
- On the computation of observers in discrete-event systems
- On optimal control of a class of partially observed discrete event systems
- Hierarchical control of discrete-event systems
- Supervisory Control of a Class of Discrete Event Processes
- An Optimal Control Theory for Discrete Event Systems
- Optimal Supervisory Control of Discrete Event Dynamical Systems
- Supervisory Control Architecture for Discrete-Event Systems