800 search results - page 6 / 160 » On the Complexity of Parity Games |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
ENTCS
2010
13 years 3 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
VMCAI
2010
Springer
14 years 3 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
SODA
2004
ACM
13 years 7 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...
TACAS
2009
Springer
14 years 16 days ago
2009
Springer
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...