conference paper published Thomas Brihaye author Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000−0002−2985−7724 Vinayak Prabhu author Jean Raskin author ICALP: Automata, Languages and Programming 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. Springer2007 10.1007/978-3-540-73420-8_71 4596825 - 837 yes Brihaye T, Henzinger TA, Prabhu V, Raskin J. Minimum-time reachability in timed games. In: Vol 4596. Springer; 2007:825-837. doi:<a href="https://doi.org/10.1007/978-3-540-73420-8_71">10.1007/978-3-540-73420-8_71</a> 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, T., Henzinger, T. A., Prabhu, V., &#38; Raskin, J. (2007). Minimum-time reachability in timed games (Vol. 4596, pp. 825–837). Presented at the ICALP: Automata, Languages and Programming, Springer. <a href="https://doi.org/10.1007/978-3-540-73420-8_71">https://doi.org/10.1007/978-3-540-73420-8_71</a> 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, Thomas, et al. <i>Minimum-Time Reachability in Timed Games</i>. Vol. 4596, Springer, 2007, pp. 825–37, doi:<a href="https://doi.org/10.1007/978-3-540-73420-8_71">10.1007/978-3-540-73420-8_71</a>. T. Brihaye, T.A. Henzinger, V. Prabhu, J. Raskin, in:, Springer, 2007, pp. 825–837. Brihaye, Thomas, Thomas A Henzinger, Vinayak Prabhu, and Jean Raskin. “Minimum-Time Reachability in Timed Games,” 4596:825–37. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-73420-8_71">https://doi.org/10.1007/978-3-540-73420-8_71</a>. 45702018-12-11T12:09:32Z2021-01-12T07:59:47Z