Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions

  • Dimitar P. Guelev
  • Catalin Dima
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5397)


We propose a variant of alternating time temporal logic ( Open image in new window ) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be uniform with respect to distributed knowledge. The model-checking problem about Open image in new window with perfect recall and imperfect information is believed to be unsolvable, whereas in our setting it is solvable because of the uniformity of strategies. We propose a model-checking algorithm for that system, which exploits the interaction between the cooperation modalities and the epistemic modality for the past. This interaction allows every expressible goal ϕ to be treated as the epistemic goal of (eventually) establishing that ϕ holds and thus enables the handling of the cooperation modalities in a streamlined way.


Model Check Temporal Logic Imperfect Information Epistemic Modality Perfect Recall 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AČC07]
    Alur, R., Černý, P., Chaudhuri, S.: Model checking on trees with path equivalences. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 664–678. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. [AHK97]
    Alur, R., Henzinger, T., Kupferman, O.: Alternating-time Temporal Logic. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pp. 100–109 (1997)Google Scholar
  3. [AHK02]
    Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 1–42 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [CDHR07]
    Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Algorithms for Omega-regular Games with Imperfect Information. Logical Methods in Computer Science 3(4), 1–23 (2007)MathSciNetzbMATHGoogle Scholar
  5. [DJ08]
    Dix, J., Jamroga, W.: Model Checking Abilities of Agents: A Closer Look. Theory of Computing Systems 42(3), 366–410 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [FvdMR05]
    French, T., van der Meyden, R., Reynolds, M.: Axioms for Logics of Knowledge and Past Time: Synchrony and Unique Initial States. In: Advances in Modal Logic, vol. 5, pp. 53–72. King’s College Publications (2005)Google Scholar
  7. [GJ04]
    Goranko, V., Jamroga, W.: Comparing Semantics for Logics of Multi-agent Systems. Synthese 139(2), 241–280 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. [GvD06]
    Goranko, V., van Drimmelen, G.: Decidability and Complete Axiomatization of the Alternating-time Temporal Logic. Theoretical Computer Science 353(1-3), 93–117 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  9. [HFMV95]
    Halpern, J., Fagin, R., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  10. [JÅ07]
    Jamroga, W., Ågotnes, T.: Constructive knowledge: what agents can achieve under imperfect information. Journal of Applied Non-Classical Logics 17(4), 423–475 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  11. [JvdH04]
    Jamroga, W., van der Hoek, W.: Agents That Know How to Play. Fundamenta Informaticae 63(2-3), 185–219 (2004)MathSciNetzbMATHGoogle Scholar
  12. [JvdH06]
    Jamroga, W., van der Hoek, W.: Strategic Ability under Uncertainty. Technical Report 6, Institute of Computer Science, Clausthal University of Technology (2006)Google Scholar
  13. [Koz83]
    Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333–354 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [LR06a]
    Lomuscio, A., Raimondi, F.: Model checking knowledge, strategies, and games in multi-agent systems. In: Proceedings of the 5th International Conference on Autonomous Agents and Multi-Agent systems (AAMAS 2006), pp. 161–168. ACM Press, New York (2006)CrossRefGoogle Scholar
  15. [LR06b]
    Lomuscio, A., Raimondi, F.: The Complexity of Model Checking Concurrent Programs Against CTLK Specifications. In: Baldoni, M., Endriss, U. (eds.) DALT 2006. LNCS, vol. 4327, pp. 29–42. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. [LS95]
    Laroussinie, F., Schnoebelen, P.: A Hierarchy of Temporal Logics with Past. Information and Computation 148(2), 303–324 (1995)MathSciNetzbMATHGoogle Scholar
  17. [LS00]
    Laroussinie, F., Schnoebelen, P.: Specification in CTL+Past for Verification in CTL. Information and Computation 156(1-2), 236–263 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  18. [Mos85]
    Moszkowski, B.: Temporal Logic For Multilevel Reasoning About Hardware. IEEE Computer 18(2), 10–19 (1985)CrossRefGoogle Scholar
  19. [Rey05]
    Reynolds, M.: An Axiomatization of PCTL*. Information and Computation 201(1), 72–119 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  20. [Sch04]
    Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2), 82–93 (2003); Proceedings of LCMAS 2003CrossRefzbMATHGoogle Scholar
  21. [SG02]
    Shilov, N.V., Garanina, N.O.: Model-checking Knowledge and Fixpoints. In: Preliminary Proceedings of the 3rd Workshop on Fixpoints in Computer Science (FICS 2002), number NS-02-2 in BRICS Notes Series, pp. 25–39. BRICS (July 2002) (Also available as Preprint 1998, Ershov, A.P., Institute of Informatics Systems, Russian Academy of Sciences (Siberian Division))Google Scholar
  22. [Tho92]
    Thomas, W.: Infinite Trees and Automation-Definable Relations over ω-Words. Theoretical Computer Science 103(1), 143–159 (1992)MathSciNetCrossRefGoogle Scholar
  23. [vdHW03]
    van der Hoek, W., Wooldridge, M.: Cooperation, Knowledge and Time: Alternating-time Temporal Epistemic Logic and Its Applications. Studia Logica 75, 125–157 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  24. [vdMS99]
    van der Meyden, R., Shilov, N.V.: Model Checking Knowledge And Time In Systems With Perfect Recall. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  25. [vOJ05]
    van Otterloo, S., Jonker, G.: On Epistemic Temporal Strategic Logic. In: Proceedings of the 2nd International Workshop on Logic and Communication in Multi-Agent Systems (2004). ENTCS, vol. 126, pp. 77–92. Elsevier, Amsterdam (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dimitar P. Guelev
    • 1
  • Catalin Dima
    • 2
  1. 1.Institute of Mathematics and InformaticsBulgarian Academy of SciencesBulgaria
  2. 2.Laboratory of Algorithms, Complexity and LogicUniversity XII of ParisFrance

Personalised recommendations