800 search results - page 1 / 160 » On the Complexity of Parity Games |
BCS
2008
13 years 6 months ago
2008
Parity games underlie the model checking problem for the modal
CSL
2008
Springer
13 years 6 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...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
ITA
2002
13 years 4 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...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...