---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Thomas
      foaf_name: Brihaye, Thomas
      foaf_surname: Brihaye
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Thomas Henzinger
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Vinayak
      foaf_name: Prabhu, Vinayak S
      foaf_surname: Prabhu
  - foaf_Person:
      foaf_givenName: Jean
      foaf_name: Raskin, Jean-François
      foaf_surname: Raskin
  bibo_doi: 10.1007/978-3-540-73420-8_71
  bibo_volume: 4596
  dct_date: 2007^xs_gYear
  dct_publisher: Springer@
  dct_title: Minimum-time reachability in timed games@
...