1503 search results - page 5 / 301 » Generalized Parity Games |
ENTCS
2010
13 years 6 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...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
SODA
2004
ACM
13 years 10 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 3 months 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...
FSTTCS
2008
Springer
13 years 10 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...