Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ENTCS
2002
110views more  ENTCS 2002»
11 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
CSL
2002
Springer
11 years 5 months ago
Trading Probability for Fairness
d Abstract) Marcin Jurdzi
Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzi...
CORR
2006
Springer
103views Education» more  CORR 2006»
11 years 5 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz
ENTCS
2008
123views more  ENTCS 2008»
11 years 5 months ago
A Multi-Core Solver for Parity Games
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
Jaco van de Pol, Michael Weber 0002
FSTTCS
2008
Springer
11 years 6 months ago
On the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
Dietmar Berwanger, Laurent Doyen
BCS
2008
11 years 6 months ago
On the Complexity of Parity Games
Parity games underlie the model checking problem for the modal
Arnold Beckmann, Faron Moller
FORMATS
2008
Springer
11 years 6 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...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
11 years 6 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
CSL
2008
Springer
11 years 7 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
CSL
2007
Springer
11 years 11 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
books