Sciweavers

2 search results - page 1 / 1
» Winning Concurrent Reachability Games Requires Doubly-Expone...
Sort
View
LICS
2009
IEEE
13 years 11 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 5 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar