Reachability-time games on timed automata

Details Reachability-time games on timed automata Reachability-time games on timed automata

2009-07-20

arxiv.org/abs/0907.3414v1

M. Jurdzi\'nski and A. Trivedi, Reachability-Time Games on Timed Automata (Extended Abstract), In ICALP, Volume 4596 of LNCS,

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reachability-time games on timed automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reachability-time games on timed automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reachability-time games on timed automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696544