Skip to main content
SpringerLink
Log in

Optimal Strategy Synthesis in Request-Response Games

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5311))

Abstract

We show the solvability of an optimization problem on infinite two-player games. The winning conditions are of the “request-response” format, i.e. conjunctions of conditions of the form “if a state with property Q is visited, then later a state with property P is visited”. We ask for solutions that do not only guarantee the satisfaction of such conditions but also minimal wait times between visits to Q-states and subsequent visits to P-states. We present a natural class of valuations of infinite plays that captures this optimization problem, and with respect to this measure show the existence of an optimal winning strategy (if a winning strategy exists at all) and that it can be realized by a finite-state machine. For the latter claim we use a reduction to the solution of mean-payoff games due to Paterson and Zwick.

Research partially supported by ANR AVERISS and by the Research Networking Programme AutoMathA of ESF (European Science Foundation).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Etessami, K., La Torre, S., Peled, D.: Parametric temporal logic for model measuring. ACM Trans. Comput. Logic 2, 388–407 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 203–218. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138, 367–378 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chatterjee, K., Henzinger, T.A.: Finitary Winning in omega-Regular Games. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 257–271. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413–422

    Google Scholar 

  6. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. of Game Theory 8, 109–113

    Google Scholar 

  7. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  8. Gimbert, H., Zielonka, W.: Games Where You Can Play Optimally Without Any Memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 428–442. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Gimbert, H., Zielonka, W.: Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 312–323. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Horn, F.: Faster Algorithms for Finitary Games. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 472–484. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Kupferman, O., Piterman, N., Vardi, M.Y.: From Liveness to Promptness. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 406–419. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. McNaughton, R.: Playing infinite games in finite time. In: Salomaa, A., Wood, D., Yu, S. (eds.) A Half-Century of Automata Theory, pp. 73–91. World Scientific, Singapore (2000)

    Google Scholar 

  13. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  14. Wallmeier, N.: Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen: Syntheseverfahren, Optimierung und Implementierung, Dissertation, RWTH Aachen (2007)

    Google Scholar 

  15. Wallmeier, N., Hütten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for request-response specifications. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 11–22. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Zielonka, W.: An Invitation to Play. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 58–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 259–343 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris 7, Case 7014, 2 place Jussieu, F-75251, Paris 5, France

    Florian Horn

  2. Lehrstuhl für Informatik 7, RWTH Aachen University, 52056, Aachen, Germany

    Florian Horn, Wolfgang Thomas & Nico Wallmeier

Authors
  1. Florian Horn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nico Wallmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Information & Communication, Division of Computer and Communication Engineering, Korea University, Anam-Dong, Seongbuk-Gu, 136-701, Seoul, South Korea

    Sungdeok (Steve) Cha

  2. Departmnet of Computer Science and Engineering, Korea University, Anam-Dong, Seongbuk-Gu, 136-702, Seoul, South Korea

    Jin-Young Choi

  3. KAIST, Department of Computer Science, Guseong-Dong, Yuseong-Gu, 305-701, Daejon, South Korea

    Moonzoo Kim

  4. School of Engineering and Applied Science, Department of Computer and Information Science,, University of Pennsylvania, Levine Hall, Room 602, 3330 Walnut Street, PA 19104-6389, Philadelphia, USA

    Insup Lee

  5. Thomas M. Siebel Center , University of Illinois at Urbana-Champaign, 201 N. Goodwin Avenue, IL 61801-2302, Urbana, USA

    Mahesh Viswanathan

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Horn, F., Thomas, W., Wallmeier, N. (2008). Optimal Strategy Synthesis in Request-Response Games. In: Cha, S.(., Choi, JY., Kim, M., Lee, I., Viswanathan, M. (eds) Automated Technology for Verification and Analysis. ATVA 2008. Lecture Notes in Computer Science, vol 5311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88387-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88387-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88386-9

  • Online ISBN: 978-3-540-88387-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation