On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Theoretical Computer Science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Active Acquisition of Information for Diagnosis and Supervisory Control of Discrete Event Systems
Discrete Event Dynamic Systems
Approximate Simulation Relations for Hybrid Systems
Discrete Event Dynamic Systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Approximately bisimilar symbolic models for nonlinear control systems
Automatica (Journal of IFAC)
Fault Diagnosis with Static and Dynamic Observers
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
PESSOA: a tool for embedded controller synthesis
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics
Brief On the model-based control of networked systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata.