skip to main content
research-article
Free Access

An Extension of ATL with Strategy Interaction

Authors Info & Claims
Published:18 June 2015Publication History
Skip Abstract Section

Abstract

We propose an extension to ATL (alternating-time temporal logic), called BSIL (basic strategy-interaction logic), for specifying collaboration among agents in a multiagent system. We show that BSIL is strictly more expressive than ATL+ but incomparable with ATL*, GL (game logic), and AMC (alternating μ-calculus) in expressiveness. We show that a memoryful strategy is necessary for fulfilling a specification in BSIL. We establish that the BSIL model-checking problem is PSPACE-complete. However, BSIL model checking can be performed in time quadratic in the model for fixed formulas. The BSIL (and hence ATL+) satisfiability is 2EXPTIME-complete. Finally, we report our experiment with a model checker for BSIL.

References

  1. Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. September 2002. Alternating-time temporal logic. Journal of the ACM (JACM) 49, 5 (Sept. 2002), 672--713. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Christel Baier, Tomas Brázdil, Marcus Gröser, and Antonin Kucera. 2007. Stochastic game logic. In QEST. IEEE Computer Society, 227--236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Mordechai Ben-Ari, Amir Pnueli, and Zohar Manna. 1983. The temporal logic of branching time. Acta Informatica 20 (1983), 207--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Thomas Brihaye, Arnaud Da Costa, François Laroussinie, and Nicolas Markey. 2009. ATL with strategy contexts and bounded memory. In LFCS, Vol. LNCS 5407. Springer-Verlag, 92--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. 2010. Strategy logic. Information and Computation 208 (2010), 677--693. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Edmumd M. Clarke, Ernest Allen Emerson, and A. Prassad Sistla. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems (TOPLAS) 8, 2 (1986), 244263. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Arnaud Da Costa, François Laroussinie, and Nicolas Markey. 2010. ATL with strategy contexts: Expressiveness and model checking. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 8. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 120--132.Google ScholarGoogle Scholar
  8. E. Allen Emerson and Edmund M. Clarke. 1980. Characterizing correctness properties of parallel programs as fixpoints. In Proceedings of the 7th Colloquium on Automata, Language, and Programming. LNCS, vol. 85. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Allen Emerson and Joe Y. Halpern. Feb. 1985. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30, 1 (Feb. 1985), 1--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. Allen Emerson and Joe Y. Halpern. Jan. 1986. ‘Sometimes’ and ‘Not Never’ Revisited: On branching versus linear time temporal logic. Journal of ACM 33, 1 (Jan. 1986), 151--178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E. Allen Emerson and Chin-Laung Lei. 1987. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming 8 (1987), 275--306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Neil Immerman. 1981. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22, 3 (1981), 65--72.Google ScholarGoogle ScholarCross RefCross Ref
  14. Daniel Kirsten. 2002. Alternating tree automata and parity games. In Automata, Logics, and Infinite Games, Erich Gradel, Wolfgang Thomas, and Thomas Wilke (Eds.). LNCS, vol. 2500. Springer, 153--167. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Orna Kupferman, Parthasarathy Madhusudan, P. S. Thiagarajan, and Moshe Y. Vardi. 2000. Open systems in reactive environments: Control and synthesis. In Proceedings of the 11th International Conference on Concurrency Theory. LNCS, vol. 1877. Springer-Verlag, 92--107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. 2001. Module checking. Information and Computation 164, 2 (2001), 322--344. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Leslie Lamport. 1980. Sometimes is sometimes “Not Never”-on the temporal logic of programs. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages. 174--185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Franois Laroussinie and Nicolas Markey. 2013. Satisfiability of ATL with strategy contexts. In Proceedings of the Workshop on Games, Automata, Logics and Formal Verification (GANDALF’13). EPTCS, vol. 119. 208--223.Google ScholarGoogle ScholarCross RefCross Ref
  19. Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Moshe Y. Vardi. 2012. What makes ATL* decidable? A decidable fragment of strategy logic. In Concurrency Theory (CONCUR’12). LNCS, vol. 7454. Springer-Verlag, 193--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Fabio Mogavero, Aniello Murano, and Luigi Sauro. 2013. On the boundary of behavioral strategies. In ACM/IEEE LICS. 263--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Fabio Mogavero, Aniello Murano, and Luigi Sauro. 2014. A behavioral hierarchy of strategy logic. In Computational Logic in Multi-Agent Systems. LNCS, vol. 8624. 148--165.Google ScholarGoogle ScholarCross RefCross Ref
  22. Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi. 2010. Reasoning about strategies. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 8. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 133--144.Google ScholarGoogle Scholar
  23. David E. Muller and Paul E. Schupp. 1995. 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 (1995), 69--107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Sophie Pinchinat. 2007. A generic constructive solution for concurrent games with expressive constraints on strategies. In Automated Technology for Verification and Analysis (ATVA’07), Vol. LNCS 4762. Springer-Verlag, 253--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Nir Piterman. 2007. From nondeterministic Büchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3, 3 (2007).Google ScholarGoogle Scholar
  26. Shmuel Safra. 1988. On the complexity of ω-automata. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS’88). IEEE Computer Society Press, 319--327. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Sven Schewe. 2009. Tighter bounds for the determinisation of Büchi automata. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’09). LNCS, vol. 5504. Springer-Verlag, 167--181. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Sven Schewe and Bernd Finkbeiner. 2007. Semi-automatic distributed synthesis. International Journal of Foundations of Computer Science 18, 1 (2007), 113--138.Google ScholarGoogle ScholarCross RefCross Ref
  29. Aravinda Prasad Sistla and Edmund M. Clarke. 1985. The complexity of propositional linear temporal logics. Journal of the ACM (JACM) 32, 3 (July 1985), 733--749. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Lawrence J. Stockmeyer. 1974. The complexity of decision problems in automata theory and logic. MIT.Google ScholarGoogle Scholar
  31. Farn Wang. 2004. Efficient verification of timed automata with BDD-like data-structures. International Journal of Software Tools for Technology Transfer (STTT) 6, 1 (2004). Special issue for the 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), LNCS, vol. 2575, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Farn Wang. 2008a. Efficient model-checking of dense-time systems with time-convexity analysis. In IEEE Real-Time System Symposium (RTSS). IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Farn Wang. 2008b. Time-progress evaluation for dense-time automata with concave path conditions. In Automated Technology for Verification and Analysis (ATVA), Vol. LNCS 5311. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Farn Wang. 2013. Efficient model-checking of dense-time systems with time-convexity analysis. Theoretical Computer Science (TCS) 467 (Jan. 2013), 89--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Farn Wang. 2015. Model-checking fair dense-time systems with propositions and events. International Journal on Software Tools for Technology Transfer (STTT) 17, 2 (2015), 223--243. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Thomas Wilke. 1999. CTL+ is exponentially more succinct than CTL. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Springer-Verlag, 110--121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Júlia Zappe. 2002. Modal μ-calculus and alternating tree automata. In Automata, Logics, and Infinite Games, Erich Gradel, Wolfgang Thomas, and Thomas Wilke (Eds.). LNCS, vol. 2500. Springer, 171--184. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An Extension of ATL with Strategy Interaction

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!