11 search results - page 1 / 3 » Uniform Solution of Parity Games on Prefix-Recognizable Grap... |
99
Voted
ENTCS
2002
14 years 9 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...
104
click to vote
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
DM
2007
14 years 10 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...