---
res:
  bibo_abstract:
  - We consider two-player games played in real time on game structures with clocks
    and parity objectives. The games are concurrent in that at each turn, both players
    independently propose a time delay and an action, and the action with the shorter
    delay is chosen. To prevent a player from winning by blocking time, we restrict
    each player to strategies that ensure that the player cannot be responsible for
    causing a zeno run. First, we present an efficient reduction of these games to
    turn-based (i.e., nonconcurrent) finite-state (i.e., untimed) parity games. The
    states of the resulting game are pairs of clock regions of the original game.
    Our reduction improves the best known complexity for solving timed parity games.
    Moreover, the rich class of algorithms for classical parity games can now be applied
    to timed parity games. Second, we consider two restricted classes of strategies
    for the player that represents the controller in a real-time synthesis problem,
    namely, limit-robust and bounded-robust strategies. Using a limit-robust strategy,
    the controller cannot choose an exact real-valued time delay but must allow for
    some nonzero jitter in each of its actions. If there is a given lower bound on
    the jitter, then the strategy is bounded-robust. We show that exact strategies
    are more powerful than limit-robust strategies, which are more powerful than bounded-robust
    strategies for any bound. For both kinds of robust strategies, we present efficient
    reductions to standard timed automaton games. These reductions provide algorithms
    for the synthesis of robust real-time controllers.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Krishnendu Chatterjee
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - 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
  bibo_doi: 10.1007/978-3-540-85778-5_10
  bibo_volume: 5215
  dct_date: 2008^xs_gYear
  dct_publisher: Springer@
  dct_title: 'Timed parity games: complexity and robustness@'
...