2 search results - page 1 / 1 » The Complexity of Stochastic Rabin and Streett Games' |
CONCUR
2006
Springer
15 years 1 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...
58
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
