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
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Information and Computation - Special issue on FLOC '96
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Timed tree automata with an application to temporal logic
Acta Informatica
Alternating-time temporal logic
Journal of the ACM (JACM)
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Decidable Dense Branching-Time Temporal Logic
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Optimal-Reachability and Control for Acyclic Weighted Timed Automata
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Finite automata on timed ω-trees
Theoretical Computer Science
Deterministic generators and games for Ltl fragments
ACM Transactions on Computational Logic (TOCL)
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
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
Program Complexity in Hierarchical Module Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
Formal Methods in System Design
Information and Computation
Parametric metric interval temporal logic
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Robust reachability in timed automata: a game-based approach
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Reachability-time games on timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
Automatic synthesis of switching controllers for linear hybrid systems: Safety control
Theoretical Computer Science
| Hi-index | 5.23 |
The solution of games is a key decision problem in the context of verification of open systems and program synthesis. Given a game graph and a specification, we wish to determine if there exists a strategy of the protagonist that allows to select only behaviors fulfilling the specification. In this paper, we consider timed games, where the game graph is a timed automaton and the specification is given by formulas of the temporal logics Ltl and Ctl. We present an automata-theoretic approach to solve the addressed games, extending to the timed framework a successful approach to solve discrete games. The main idea of this approach is to translate the timed automaton A, modeling the game graph, into a tree automaton A^T accepting all trees that correspond to a strategy of the protagonist. Then, given an automaton corresponding to the specification, we intersect it with the tree automaton A^T and check for the nonemptiness of the resulting automaton. Our approach yields a decision algorithm running in exponential time for Ctl and in double exponential time for Ltl. The obtained algorithms are optimal in the sense that their computational complexity matches the known lower bounds.