64 search results - page 5 / 13 » Solving Parity Games in Practice |
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
COGSCI
2004
14 years 11 months ago
2004
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
102
click to vote
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
112
click to vote
SOFSEM
2012
Springer
13 years 7 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...