Approximating the minimal sensor selection for supervisory control

DOI10.1007/s10626-006-6187-3zbMath1103.93019MaRDI QIDQ853685

Samir Khuller, Guy Kortsarz, Kurt R. Rohloff

Publication date: 17 November 2006

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-006-6187-3

zbMATH Keywords

Automata; Computational complexity; Approximation algorithms; Supervisory control; Sensor selection

Mathematics Subject Classification ID

68Q45: Formal languages and automata

93B17: Transformations

93B50: Synthesis problems

68W25: Approximation algorithms

Related Items

On the computation of natural observers in discrete-event systems, Improved approximation algorithms for label cover problems, Approximating the minimal sensor selection for supervisory control

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the minimal sensor selection for supervisory control
• On observability of discrete-event systems
• On the control of discrete-event dynamical systems
• Supervisory Control of a Class of Discrete Event Processes
• A Parallel Repetition Theorem
• The computational complexity of decentralized discrete-event control problems
• Optimal sensor selection for discrete-event systems with partial observation
• NP-completeness of sensor selection problems arising in partially observed discrete-event systems
• Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems
• On the hardness of approximating spanners