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.
- 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 Scholar
Digital Library
- Christel Baier, Tomas Brázdil, Marcus Gröser, and Antonin Kucera. 2007. Stochastic game logic. In QEST. IEEE Computer Society, 227--236. Google Scholar
Digital Library
- Mordechai Ben-Ari, Amir Pnueli, and Zohar Manna. 1983. The temporal logic of branching time. Acta Informatica 20 (1983), 207--226. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. 2010. Strategy logic. Information and Computation 208 (2010), 677--693. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company. Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. 2001. Module checking. Information and Computation 164, 2 (2001), 322--344. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- Fabio Mogavero, Aniello Murano, and Luigi Sauro. 2013. On the boundary of behavioral strategies. In ACM/IEEE LICS. 263--272. Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Sven Schewe and Bernd Finkbeiner. 2007. Semi-automatic distributed synthesis. International Journal of Foundations of Computer Science 18, 1 (2007), 113--138.Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- Lawrence J. Stockmeyer. 1974. The complexity of decision problems in automata theory and logic. MIT.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Farn Wang. 2013. Efficient model-checking of dense-time systems with time-convexity analysis. Theoretical Computer Science (TCS) 467 (Jan. 2013), 89--108. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Index Terms
An Extension of ATL with Strategy Interaction
Recommendations
A temporal logic for the interaction of strategies
CONCUR'11: Proceedings of the 22nd international conference on Concurrency theoryWe propose an extension to ATL (alternating-time logic), called BSIL (basic strategy-interaction logic), for the specification of interaction among the strategies of agents in a multi-agent system. BSIL allows for the specifications of one system ...
Augmenting ATL with strategy contexts
We study the extension of the alternating-time temporal logic (ATL) with strategy contexts: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies.We show that our extension ATL s c ...
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiabilityWe present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSATCNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...






Comments