Advertisement

Acta Informatica

, Volume 51, Issue 3–4, pp 129–163 | Cite as

Strategy synthesis for multi-dimensional quantitative objectives

  • Krishnendu Chatterjee
  • Mickael RandourEmail author
  • Jean-François Raskin
Original Article

Abstract

Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express \(\omega \)-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.

Notes

Acknowledgments

Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. Jean-François Raskin is supported by ERC Starting Grant (279499: inVEST).

References

  1. Abdulla, P.A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Proceedings of TACAS, LNCS 6015. Springer (2010)Google Scholar
  2. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)CrossRefMathSciNetGoogle Scholar
  3. Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge, MA (2008)zbMATHGoogle Scholar
  4. Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. ITA 36(3), 261–275 (2002)zbMATHMathSciNetGoogle Scholar
  5. Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Proceedings of CAV, LNCS 5643, pp. 140–156. Springer (2009)Google Scholar
  6. Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: Proceedings of FMCAD, pp. 85–92. IEEE (2009)Google Scholar
  7. Bohy, A., Bruyère, V., Filiot, E., Raskin, J.-F.: Synthesis from LTL specifications with mean-payoff objectives. In: Proceedings of TACAS, LNCS 7795, pp. 169–184. Springer (2013)Google Scholar
  8. Borosh, I., Treybig, B.: Bounds on positive integral solutions of linear diophantine equations. Proc. Am. Math. Soc. 55(2), 299–304 (1976)CrossRefzbMATHMathSciNetGoogle Scholar
  9. Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Proceedings of FORMATS, LNCS 5215, pp. 33–47. Springer (2008)Google Scholar
  10. Bouyer, P., Markey, N., Olschewski, J., Ummels, M.: Measuring permissiveness in parity games: mean-payoff parity games revisited. In: Proceedings of ATVA, LNCS 6996, pp. 135–149. Springer (2011)Google Scholar
  11. Brázdil, T., Jancar, P., Kucera, A.: Reachability games on extended vector addition systems with states. In: Proceedings of ICALP, LNCS 6199, pp. 478–489. Springer (2010)Google Scholar
  12. Cerný, P., Chatterjee, K., Henzinger, T.A., Radhakrishna, A., Singh, R.: Quantitative synthesis for concurrent programs. In: Proceedings of CAV, LNCS 6806, pp. 243–259. Springer (2011)Google Scholar
  13. Cerný, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. Theor. Comput. Sci. 413(1), 21–35 (2012)CrossRefzbMATHGoogle Scholar
  14. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Proceedings of EMSOFT, LNCS 2855, pp. 117–133. Springer (2003)Google Scholar
  15. Chatterjee, K., Doyen, L.: Energy parity games. In: Proceedings of ICALP, LNCS 6199, pp. 599–610. Springer (2010)Google Scholar
  16. Chatterjee, K., Doyen, L.: Games and markov decision processes with mean-payoff parity and energy parity objectives. In: Proceedings of MEMICS, LNCS. Springer (2011)Google Scholar
  17. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Log. 11(4), Art. no. 23 (2010). http://dl.acm.org/citation.cfm?id=1805953&dl=ACM&coll=DL&CFID=348120849&CFTOKEN=19768725
  18. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: Proceedings of FSTTCS, LIPIcs 8, pp. 505–516. Schloss Dagstuhl—LZI (2010)Google Scholar
  19. Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: Proceedings of LICS, pp. 178–187. IEEE Computer Society (2005)Google Scholar
  20. Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multi-dimensional quantitative objectives. In: Proceedings of CONCUR, LNCS 7454, pp. 115–131. Springer (2012)Google Scholar
  21. Church, A.: Logic, arithmetic, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23–35. Institut Mittag-Leffler (1962)Google Scholar
  22. de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Proceedings of EMSOFT, LNCS 2211, pp. 148–165. Springer (2001)Google Scholar
  23. De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: a new algorithm for checking universality of finite automata. In: Proceedings of CAV, LNCS 4144, pp. 17–30. Springer (2006)Google Scholar
  24. Doyen, L., Raskin, J.-F.: Antichains algorithms for finite automata. In: Proceedings of TACAS, LNCS 6015, pp. 2–22. Springer (2010)Google Scholar
  25. Doyen, L., Raskin, J.-F.: Games with imperfect information: theory and algorithms. In: Lectures in Game Theory for Computer Scientists, pp. 185–212 (2011)Google Scholar
  26. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109–113 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  27. Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: Proceedings of FOCS, pp. 328–337. IEEE (1988)Google Scholar
  28. Emerson, E.A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proceedings of FOCS, pp. 368–377. IEEE (1991)Google Scholar
  29. Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy games in multiweighted automata. In: Proceedings of ICTAC, LNCS 6916, pp. 95–115. Springer (2011)Google Scholar
  30. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, logics, and infinite games: a guide to current research. In: LNCS 2500. Springer (2002)Google Scholar
  31. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proceedings of STOC, pp. 60–65. ACM (1982)Google Scholar
  32. Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. Inf. Comput. 173(1), 64–81 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  33. Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363–371 (1975)CrossRefzbMATHGoogle Scholar
  34. Martin, D.A.: The determinacy of Blackwell games. J. Symb. Logic 63(4), 1565–1581 (1998)CrossRefzbMATHGoogle Scholar
  35. Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS, pp. 46–57. IEEE Computer Society (1977)Google Scholar
  36. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of POPL, pp. 179–190 (1989)Google Scholar
  37. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  38. Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAMbreak J. Control Optim. 25(1), 206–230 (1987)CrossRefzbMATHMathSciNetGoogle Scholar
  39. Rosier, L.E., Yen, H.-C.: A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. Syst. Sci. 32(1), 105–135 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  40. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, Beyond Words, chapter 7, pp. 389–455. Springer, Berlin (1997)Google Scholar
  41. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of FOCS, pp. 327–338. IEEE Computer Society (1985)Google Scholar
  42. Velner, Y., Rabinovich, A.: Church synthesis problem for noisy input. In: Proceedings of FOSSACS, LNCS 6604, pp. 275–289. Springer (2011)Google Scholar
  43. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1–2), 135–183 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  44. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343–359 (1996)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Krishnendu Chatterjee
    • 1
  • Mickael Randour
    • 2
    Email author
  • Jean-François Raskin
    • 3
  1. 1.IST Austria (Institute of Science and Technology Austria)KlosterneuburgAustria
  2. 2.Computer Science DepartmentUniversité de Mons (UMONS)MonsBelgium
  3. 3.Département d’InformatiqueUniversité Libre de Bruxelles (U.L.B.)BrusselsBelgium

Personalised recommendations