We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity game, which both generalizes previous results and improves their complexity. To this end, we introduce a class of ω-regular games with imperfect information and imperfect recall, solve them using automata-based techniques, and prove a correspondence between finite-memory strategies in such games and strategies in counter parity games. © 2012 Springer-Verlag.
CITATION STYLE
Berwanger, D., Kaiser, Ł., & Leßenich, S. (2012). Solving counter parity games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 160–171). https://doi.org/10.1007/978-3-642-32589-2_17
Mendeley helps you to discover research relevant for your work.