46 search results - page 1 / 10 » The Descriptive Complexity of Parity Games |
CSL
2008
Springer
15 years 15 days 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...
101
click to vote
BCS
2008
15 years 5 days ago
2008
Parity games underlie the model checking problem for the modal
LPAR
2010
Springer
14 years 9 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...
150
click to vote
ILC
2007
Springer
15 years 4 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
ITA
2002
14 years 10 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...