Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Theoretical Computer Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On using priced timed automata to achieve optimal scheduling
Formal Methods in System Design
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Improved undecidability results on weighted timed automata
Information Processing Letters
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Almost optimal strategies in one clock priced timed games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimum-time reachability in timed games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Concavely-Priced Timed Automata
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On reachability games of ordinal length
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Integer parameter synthesis for timed automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Information and Computation
ACM Computing Surveys (CSUR)
A faster algorithm for solving one-clock priced timed games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Automata-theoretic decision of timed games
Theoretical Computer Science
| Hi-index | 0.00 |
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachability-time games on strongly non-Zeno timed automata using a value iteration algorithm. This paper complements their work by providing a strategy improvement algorithm for the problem. It also generalizes their decidability result because the proposed strategy improvement algorithm solves reachability-time games on all timed automata. The exact computational complexity of solving reachability-time games is also established: the problem is EXPTIME-complete for timed automata with at least two clocks.