Sciweavers

18 search results - page 1 / 4
» Strategy Improvement for Concurrent Reachability Games
Sort
View
QEST
2006
IEEE
15 years 4 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
80
Voted
CORR
2008
Springer
122views Education» more  CORR 2008»
14 years 10 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
LICS
2009
IEEE
15 years 4 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ý, ...
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 10 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
ICALP
2007
Springer
15 years 4 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi