Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Reasoning about infinite computations
Information and Computation
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Finite automata on timed ω-trees
Theoretical Computer Science
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Deterministic Generators and Games for Ltl Fragments
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
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
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Finite automata on timed ω-trees
Theoretical Computer Science
Trading Infinite Memory for Uniform Randomness in Timed Games
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Automata-theoretic decision of timed games
Theoretical Computer Science
| Hi-index | 0.00 |
The solution of games is a key decision problem in the context of verification of open systems and program synthesis. We present an automata-theoretic approach to solve timed games. Our solution gives a general framework to solve many classes of timed games via a translation to tree automata, extending to timed games a successful approach to solve discrete games. Our approach relies on translating a timed automaton into a tree automaton that accepts all the trees corresponding to a given strategy of the protagonist. This construction exploits the region automaton introduced by Alur and Dill. We use our framework to solve timed B眉chi games in exponential time, timed Rabin games in exponential time, CTL games in exponential time and Ltl games in doubly exponential time. All these results are tight in the sense that they match the known lower bounds on these decision problems.