Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Three partition refinement algorithms
SIAM Journal on Computing
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
&egr;-approximation of differential inclusions
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Discrete-Time Control for Rectangular Hybrid Automata
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
State Equivalences for Rectangular Hybrid Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Control Synthesis for a Class of Hybrid Systems Subject to Configuration-Based Safety Constraints
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Controllers for reachability specifications for hybrid systems
Automatica (Journal of IFAC)
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decidable Model Checking of Probabilistic Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Model checking the quantitative µ-calculus on linear hybrid systems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Specifications for decidable hybrid games
Theoretical Computer Science
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability games for linear hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Playing hybrid games with keymaera
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Tracking differentiable trajectories across polyhedra boundaries
Proceedings of the 16th international conference on Hybrid systems: computation and control
Safe schedulability of bounded-rate multi-mode systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Supervisor synthesis for controller upgrades
Proceedings of the Conference on Design, Automation and Test in Europe
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Theoretical Computer Science
Automatic synthesis of switching controllers for linear hybrid systems: Safety control
Theoretical Computer Science
Automata-theoretic decision of timed games
Theoretical Computer Science
| Hi-index | 0.02 |
In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games -- say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Ltl (linear temporal logic), the winning states for each player can be computed, and winning strategies can be synthesized. Our result is sharp, as already reachability is undecidable for generalizations of rectangular systems, and optimal -- singly exponential in the size of the game structure and doubly exponential in the size of the Ltl objective. Our proof systematically generalizes the theory of hybrid systems from automata (single-player structures) [9] to games (multi-player structures): we show that the successively more general infinite-state classes of timed, 2D rectangular, and rectangular games induce successively weaker, but still finite, quotient structures called game bisimilarity, game similarity, and game trace equivalence. These quotients can be used, in particular, to solve the Ltl control problem.