---
res:
  bibo_abstract:
  - 'We consider two-player games played on a finite state space for an infinite number
    of rounds. The games are concurrent: in each round, the two players (player 1
    and player 2) choose their moves independently and simultaneously; the current
    state and the two moves determine the successor state. We consider ω-regular winning
    conditions specified as parity objectives. Both players are allowed to use randomization
    when choosing their moves. We study the computation of the limit-winning set of
    states, consisting of the states where the sup-inf value of the game for player
    1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability
    of winning arbitrarily close to 1. We show that the limit-winning set can be computed
    in O(n2d+2) time, where n is the size of the game structure and 2d is the number
    of priorities (or colors). The membership problem of whether a state belongs to
    the limit-winning set can be decided in NP ∩ coNP. While this complexity is the
    same as for the simpler class of turn-based parity games, where in each state
    only one of the two players has a choice of moves, our algorithms are considerably
    more involved than those for turn-based games. This is because concurrent games
    do not satisfy two of the most fundamental properties of turn-based parity games.
    First, in concurrent games limit-winning strategies require randomization; and
    second, they require infinite memory.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Luca
      foaf_name: De Alfaro, Luca
      foaf_surname: De Alfaro
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  bibo_doi: 10.1145/1970398.1970404
  bibo_issue: '4'
  bibo_volume: 12
  dct_date: 2011^xs_gYear
  dct_identifier:
  - UT:000296202300006
  dct_language: eng
  dct_publisher: ACM@
  dct_title: Qualitative concurrent parity games@
...