Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aminof, B., Kupferman, O., Lampert, R.: Formal Analysis of Online Algorithms. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 213–227. Springer, Heidelberg (2011)
Berwanger, D., Kaiser, Ł., Leßenich, S.: Imperfect recall and counter games. Research Report LSV-11-20, LSV, ENS Cachan, France (2011), http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-20.pdf
Brázdil, T., Forejt, V., Krcál, J., Kretínský, J., Kucera, A.: Continuous-time stochastic games with time-bounded reachability. In: Proc. of FSTTCS 2009, pp. 61–72 (2009)
Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: Proc. of FSTTCS 2010, pp. 505–516 (2010)
Chatterjee, K., Henzinger, T.A., Horn, F.: The Complexity of Request-Response Games. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 227–237. Springer, Heidelberg (2011)
de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. Theoretical Computer Science 345(1), 139–170 (2005)
Fischer, D., Grädel, E., Kaiser, Ł.: Model checking games for the quantitative μ-calculus. Theory Comput. Syst. 47(3), 696–719 (2010)
Fischer, D., Kaiser, Ł.: Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 404–415. Springer, Heidelberg (2011)
Horn, F., Thomas, W., Wallmeier, N.: Optimal Strategy Synthesis in Request-Response Games. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 361–373. Springer, Heidelberg (2008)
Kaiser, Ł., Leßenich, S.: Counting μ-calculus on structured transition systems. In: Proc. of CSL 2012. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany (to appear, 2012)
Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. Formal Methods in System Design 34(2), 83–103 (2009)
Thomas, W.: Infinite Games and Verification (Extended Abstract of a Tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58–64. Springer, Heidelberg (2002)
Wan, H.: Upper bounds for Ramsey numbers R(3, 3,…, 3) and Schur numbers. Journal of Graph Theory 26(3), 119–122 (1997)
Zimmermann, M.: Optimal bounds in parametric LTL games. In: Proc. of GandALF 2011, pp. 146–161 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berwanger, D., Kaiser, Ł., Leßenich, S. (2012). Solving Counter Parity Games. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-32589-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32588-5
Online ISBN: 978-3-642-32589-2
eBook Packages: Computer ScienceComputer Science (R0)