Brihaye, Thomas; Henzinger, Thomas AIST Austria ; Prabhu, Vinayak S; Raskin, Jean-François
We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to reach a target location against all possible choices of the opponent. We do not put any syntactic restriction on the game structure, nor do we require any player to guarantee time divergence. We only require players to use receptive strategies which do not block time. The minimal time is computed in part using a fixpoint expression, which we show can be evaluated on equivalence classes of a non-trivial extension of the clock-region equivalence relation for timed automata.
This research was supported in part by the NSF grant CCR-0225610 and by the Swiss National Science Foundation.
825 - 837
ICALP: Automata, Languages and Programming
Brihaye T, Henzinger TA, Prabhu V, Raskin J. Minimum-time reachability in timed games. In: Vol 4596. Springer; 2007:825-837. doi:10.1007/978-3-540-73420-8_71
Brihaye, T., Henzinger, T. A., Prabhu, V., & Raskin, J. (2007). Minimum-time reachability in timed games (Vol. 4596, pp. 825–837). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/978-3-540-73420-8_71
Brihaye, Thomas, Thomas A Henzinger, Vinayak Prabhu, and Jean Raskin. “Minimum-Time Reachability in Timed Games,” 4596:825–37. Springer, 2007. https://doi.org/10.1007/978-3-540-73420-8_71.
T. Brihaye, T. A. Henzinger, V. Prabhu, and J. Raskin, “Minimum-time reachability in timed games,” presented at the ICALP: Automata, Languages and Programming, 2007, vol. 4596, pp. 825–837.
Brihaye T, Henzinger TA, Prabhu V, Raskin J. 2007. Minimum-time reachability in timed games. ICALP: Automata, Languages and Programming, LNCS, vol. 4596. 825–837.
Brihaye, Thomas, et al. Minimum-Time Reachability in Timed Games. Vol. 4596, Springer, 2007, pp. 825–37, doi:10.1007/978-3-540-73420-8_71.