Sciweavers

71 search results - page 3 / 15
» Clique-Width and Parity Games
Sort
View
ITA
2002
163views Communications» more  ITA 2002»
13 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
CSL
2002
Springer
13 years 4 months ago
Trading Probability for Fairness
d Abstract) Marcin Jurdzi
Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzi...
LPAR
2010
Springer
13 years 3 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 classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
FOSSACS
2006
Springer
13 years 8 months ago
Parity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
Olivier Serre
ENTCS
2002
110views more  ENTCS 2002»
13 years 4 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
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...
Thierry Cachat