ENTCS
2002
13 years 11 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...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
d Abstract) Marcin Jurdzi
CORR
2006
Springer
13 years 11 months ago
2006
Springer
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...
ENTCS
2008
13 years 11 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
FSTTCS
2008
Springer
14 years 15 days ago
2008
Springer
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...
BCS
2008
14 years 27 days ago
2008
Parity games underlie the model checking problem for the modal
FORMATS
2008
Springer
14 years 1 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...
FM
2008
Springer
14 years 1 months ago
2008
Springer
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...
CSL
2008
Springer
14 years 1 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...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
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...