Approximating the minimal sensor selection for supervisory control
From MaRDI portal
Publication:853685
DOI10.1007/S10626-006-6187-3zbMATH Open1103.93019OpenAlexW2012722516MaRDI QIDQ853685FDOQ853685
Guy Kortsarz, Kurt R. Rohloff, Samir Khuller
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
Formal languages and automata (68Q45) Approximation algorithms (68W25) Synthesis problems (93B50) Transformations (93B17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Supervisory Control of a Class of Discrete Event Processes
- A Parallel Repetition Theorem
- On the control of discrete-event dynamical systems
- On observability of discrete-event systems
- Optimal sensor selection for discrete-event systems with partial observation
- NP-completeness of sensor selection problems arising in partially observed discrete-event systems
- Approximating the minimal sensor selection for supervisory control
- Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems
- On the hardness of approximating spanners
- The computational complexity of decentralized discrete-event control problems
Cited In (14)
- Simultaneous Optimal Control and Discrete Stochastic Sensor Selection
- Approximate Supermodularity of Kalman Filter Sensor Selection
- On the computation of natural observers in discrete-event systems
- Online minimization of sensor activation for supervisory control
- Supervisory control of discrete event systems with distinguishers
- Minimization of Dynamic Sensor Activation in Discrete Event Systems for the Purpose of Control
- Privacy preserving minimal observability for composite transactional services
- A diagnoser algorithm for anomaly detection in DEDS under partial and unreliable observations: characterization and inclusion in sensor configuration optimization
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
- Approximating the minimal sensor selection for supervisory control
- Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
- Minimal sensor activation and minimal communication in discrete-event systems
- Refined parameterizations for computing colored cuts in edge-colored graphs
- Improved approximation algorithms for label cover problems
Uses Software
This page was built for publication: Approximating the minimal sensor selection for supervisory control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853685)
