1599 search results - page 12 / 320 » Algorithms for Parity Games |
SOFSEM
2012
Springer
13 years 5 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...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
144
click to vote
ILC
2007
Springer
15 years 3 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
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 ...