Skip to main content
Springer Nature Link
Log in

A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies

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

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

Abstract

The emerging technology of interacting systems calls for new formalisms to ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics have been studied. However, the existing formalisms show certain limitations in face of the range of strategy properties required to address intuitive situations. We propose a generic solution to specify expressive constraints on strategies in concurrent games. Our formalism naturally extends alternating-time logics while being highly flexible to combine constraints. Our approach is constructive and can synthesize many types of complex strategies, via automata-theoretic techniques.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Adler, B.T., de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Raman, V., Roy, P.: Ticc: A tool for interface compatibility and composition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 59–62. Springer, Heidelberg (2006)

    Google Scholar 

  2. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)

    Article  MathSciNet  Google Scholar 

  3. Arnold, A., Niwinski, D.: Rudiments of mu-calculus. North-Holland, Amsterdam (2001)

    Book  MATH  Google Scholar 

  4. Berwanger, D.: Admissibility in infinite games. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Chatterjee, K.: Two-player nonzero-sum omega -regular games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 413–427. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 59–73. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Dam, M.: CTL⋆ and ECTL⋆ as fragments of the modal μ-calculus. Theoretical Computer Science 126(1), 77–96 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Emerson, E.A., Sistla, A.P.: Deciding full branching time logic. Information and Control 61, 175–201 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of the alternating-time temporal logic. Theoretical Computer Science 353(1), 93–117 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Henzinger, T.A., Kupferman, O., Qadeer, S.: From re-historic to ost-modern symbolic model checking. In: Vardi, M.Y., Hu, A.J. (eds.) CAV 1998. LNCS, vol. 1427, pp. 195–206. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Jurdziński, M.: Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters 68(3), 119–124 (1998)

    Article  MathSciNet  Google Scholar 

  12. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27(3), 333–354 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kacprzak, M., Penczek, W.: Unbounded model checking for alternating-time temporal logic. In: Kudenko, D., Kazakov, D., Alonso, E. (eds.) AAMAS 2004, pp. 646–653. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  14. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM 47(2), 312–360 (2000)

    Article  MathSciNet  Google Scholar 

  15. Laroussinie, F., Markey, N., Oreiby, G.: On the expressiveness and complexity of ATL. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 243–257. Springer, Heidelberg (2007)

    Google Scholar 

  16. Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141(1–2), 69–107 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pinchinat, S.: A generic constructive solution for concurrent games with expressive constraints on strategies (full version) August 2007 IRISA Internal Publication 1861, INRIA Research Report (to appear)

    Google Scholar 

  18. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  19. Riedweg, S., Pinchinat, S.: Quantified mu-calculus for control synthesis. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 642–651. Springer, Heidelberg (2003)

    Google Scholar 

  20. Schewe, S., Finkbeiner, B.: Satisfiability and finite model property for the alternating-time μ-calculus. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, Springer, Heidelberg (2006)

    Google Scholar 

  21. van Drimmelen, G.: Satisfiability in alternating-time temporal logic. In: LICS, pp. 208–217. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  22. Wilke. T.: Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg. 8(2) (May 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Laboratory of RSISE, The Australian National University, Canberra,  

    Sophie Pinchinat

Authors
  1. Sophie Pinchinat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kedar S. Namjoshi Tomohiro Yoneda Teruo Higashino Yoshio Okamura

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinchinat, S. (2007). A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds) Automated Technology for Verification and Analysis. ATVA 2007. Lecture Notes in Computer Science, vol 4762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75596-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75596-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75595-1

  • Online ISBN: 978-3-540-75596-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy