32 search results - page 1 / 7 » Winning Cores in Parity Games |
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
ITA
2002
14 years 9 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
IPL
2008
14 years 9 months ago
2008
Abstract. 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 speci...
84
Voted
ENTCS
2008
14 years 9 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
94
Voted
ENTCS
2002
14 years 9 months ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...