Article

ATL with Strategy Contexts and Bounded Memory

Authors:

Thomas Brihaye,

François Laroussinie,

Nicolas MarkeyAuthors Info & Claims

LFCS '09: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science

Pages 92 - 106

https://doi.org/10.1007/978-3-540-92687-0_7

Published: 03 January 2009 Publication History

Abstract

We extend the alternating-time temporal logics <Emphasis FontCategory="SansSerif">ATL</Emphasis> and <Emphasis FontCategory="SansSerif">ATL</Emphasis> * with <em>strategy contexts</em> and <em>memory constraints</em> : the first extension makes strategy quantifiers to not "forget" the strategies being executed by the other players. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies.

We first consider expressiveness issues. We show that our logics can express important properties such as equilibria, and we formally compare them with other similar formalisms (<Emphasis FontCategory="SansSerif">ATL</Emphasis>, <Emphasis FontCategory="SansSerif">ATL</Emphasis> *, Game Logic, Strategy Logic, ...). We then address the problem of model-checking for our logics, especially we provide a <Emphasis FontCategory="SansSerif">PSPACE</Emphasis> algorithm for the sublogics involving only memoryless strategies and an <Emphasis FontCategory="SansSerif">EXPSPACE</Emphasis> algorithm for the bounded-memory case.

References

[1]

Ågotnes, T., Goranko, V., Jamroga, W.: Alternating-time temporal logics with irrevocable strategies. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2007), pp. 15-24 (June 2007)

[2]

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

[3]

Baier, C., Brázdil, T., Größer, M., Kučera, A.: Stochastic game logic. In: Proceedings of the 4th International Conference on Quantitative Evaluation of Systems (QEST 2007), pp. 227-236. IEEE Comp. Soc. Press, Los Alamitos (2007)

[4]

Brihaye, T., Costa, A.D., Laroussinie, F., Markey, N.: ATL with strategy contexts and bounded memory. Technical Report LSV-08-14, Lab. Specification et Verification (February 2008)

[5]

Chatterjee, K., Henzinger, T.A., Jurdziński, M.: Games with secure equilibria. Theoretical Computer Science 365(1-2), 67-82 (2006)

[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)

[7]

Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronous skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52-71. Springer, Heidelberg (1982)

[8]

Jamroga, W., Dix, J.: Do agents make model checking explode (computationally)? In: Pěchouček, M., Petta, P., Varga, L.Z. (eds.) CEEMAS 2005. LNCS, vol. 3690, pp. 398-407. Springer, Heidelberg (2005)

[9]

Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Information and Computation 164(2), 322-344 (2001)

[10]

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)

[11]

Mazala, R.: Infinite games. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 23-42. Springer, Heidelberg (2002)

[12]

Pinchinat, S.: A generic constructive solution for concurrent games with expressive constraints on strategies. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 253-267. Springer, Heidelberg (2007)

[13]

Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pp. 46-57. IEEE Comp. Soc. Press, Los Alamitos (1977)

[14]

Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337-351. Springer, Heidelberg (1982)

[15]

Schobbens, P.-Y.: Alternating-time logic with imperfect recall. In: Proceedings of the 1st Workshop on Logic and Communication in Multi-Agent Systems (LCMAS 2003). ENTCS, vol. 85. Elsevier, Amsterdam (2004)

[16]

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)

Cited By

Bozzelli LMurano ASorrentino L(2020)Alternating-time temporal logics with linear pastTheoretical Computer Science10.1016/j.tcs.2019.11.028813:C(199-217)Online publication date: 12-Apr-2020
https://dl.acm.org/doi/10.1016/j.tcs.2019.11.028
Belardinelli FJamroga WKurpiewski DMalvone VMurano A(2019)Strategy logic with simple goalsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367046(88-94)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367046
Bulling NJamroga WPopovici M(2019)Reasoning about Strategic AbilitiesACM Transactions on Computational Logic10.1145/330976120:2(1-46)Online publication date: 18-Mar-2019
https://dl.acm.org/doi/10.1145/3309761
Show More Cited By

Recommendations

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 ...
Alternating-time temporal logic ATL with finitely bounded semantics
Abstract
We study a variant ATL FB of the alternating-time temporal logic ATL with a non-standard, ‘finitely bounded’ semantics (FBS). FBS was originally defined as a game-theoretic semantics where players must commit to time limits when ...
On satisfiability in ATL with strategy contexts
JELIA'12: Proceedings of the 13th European conference on Logics in Artificial Intelligence

This paper is a study of Brihaye et al.'s ATL with strategy contexts. We focus on memory-less strategies and establish that the resulting logic is undecidable. An immediate corollary follows that the problem of satisfiability checking of every variant ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

LFCS '09: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science

January 2009

467 pages

ISBN:9783540926863

Editors:
Sergei Artemov
Computer Science, CUNY Graduate Center, New York, USA NY 10016
,
Anil Nerode
Department of Mathematics, Cornell University, Ithaca, USA NY 14853

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 January 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bozzelli LMurano ASorrentino L(2020)Alternating-time temporal logics with linear pastTheoretical Computer Science10.1016/j.tcs.2019.11.028813:C(199-217)Online publication date: 12-Apr-2020
https://dl.acm.org/doi/10.1016/j.tcs.2019.11.028
Belardinelli FJamroga WKurpiewski DMalvone VMurano A(2019)Strategy logic with simple goalsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367046(88-94)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367046
Bulling NJamroga WPopovici M(2019)Reasoning about Strategic AbilitiesACM Transactions on Computational Logic10.1145/330976120:2(1-46)Online publication date: 18-Mar-2019
https://dl.acm.org/doi/10.1145/3309761
Goranko VJu F(2019)Towards a Logic for Conditional Local Strategic ReasoningLogic, Rationality, and Interaction10.1007/978-3-662-60292-8_9(112-125)Online publication date: 18-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-662-60292-8_9
Goranko VEnqvist SAndre EKoenig SDastani MSukthankar G(2018)Socially Friendly and Group Protecting Coalition LogicsProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237442(372-380)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237442
Huang XMeyden R(2018)An Epistemic Strategy LogicACM Transactions on Computational Logic10.1145/323376919:4(1-45)Online publication date: 30-Nov-2018
https://dl.acm.org/doi/10.1145/3233769
Goranko VKuusisto ARönnholm RLarson KWinikoff MDas SDurfee E(2017)Game-Theoretic Semantics for ATL+ with Applications to Model CheckingProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091302(1277-1285)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091302
Berthon RMaubert BMurano ALarson KWinikoff MDas SDurfee E(2017)Decidability Results for ATL* with Imperfect Information and Perfect RecallProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091299(1250-1258)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091299
Jamroga WMalvone VMurano ALarson KWinikoff MDas SDurfee E(2017)Reasoning about Natural Strategic AbilityProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091227(714-722)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091227
Huang CSchewe SWang F(2017)Model-checking iterated gamesActa Informatica10.1007/s00236-016-0277-y54:7(625-654)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s00236-016-0277-y
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten