30 search results - page 2 / 6 » Permissive strategies: from parity games to safety games |
CORR
2006
Springer
13 years 5 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
2010
13 years 2 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
SODA
2004
ACM
13 years 6 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...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...