Sciweavers

Share
836 search results - page 1 / 168
» On the Complexity of Parity Games
Sort
View
BCS
2008
8 years 5 months ago
On the Complexity of Parity Games
Parity games underlie the model checking problem for the modal
Arnold Beckmann, Faron Moller
CSL
2008
Springer
8 years 6 months ago
The Descriptive Complexity of Parity Games
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...
Anuj Dawar, Erich Grädel
LPAR
2010
Springer
8 years 2 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classi´Čüed as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
ITA
2002
163views Communications» more  ITA 2002»
8 years 4 months ago
Permissive strategies: from parity games to safety games
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...
Julien Bernet, David Janin, Igor Walukiewicz
FORMATS
2008
Springer
8 years 5 months ago
Timed Parity Games: Complexity and Robustness
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...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
books