9 search results - page 2 / 2 » Parity Games Played on Transition Graphs of One-Counter Proc... |
CONCUR
2009
Springer
14 years 10 days ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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 ...