On the complexity of synthesizing a minimum-weighted supervisor under partial observation
DOI10.1016/J.AUTOMATICA.2014.04.009zbMATH Open1296.93003OpenAlexW1997056479MaRDI QIDQ458885FDOQ458885
Authors: Rong Su 
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
Recommendations
- Undecidability in decentralized supervision
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- Effective control synthesis for partially observed discrete-event systems
- On-line control of partially observed discrete event systems
- Online supervisor synthesis for partially observed discrete-event systems
normalitycontrollabilityweighted automatanatural observerNP-completeness/hardnesssupervisor synthesis
Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Hierarchical systems (93A13) Observability (93B07)
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Supervisory Control of a Class of Discrete Event Processes
- Hierarchical control of discrete-event systems
- Supervisory Control Architecture for Discrete-Event Systems
- 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
- An Optimal Control Theory for Discrete Event Systems
- Optimal Supervisory Control of Discrete Event Dynamical Systems
Cited In (2)
This page was built for publication: On the complexity of synthesizing a minimum-weighted supervisor under partial observation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458885)
