Skip to main content
SpringerLink
Log in

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

Alternating-time Temporal Logic (ATL) is typically applied for specifying properties of multi-agent systems modelled by game-like structures. This paper deals with verification of ATL by means of a fully symbolic model checking. Unbounded model checking (a SAT-based technique) is applied for the first time to verification of AT. Several examples are given in order to present an application of the technique.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Alur, L. de Alfaro, T. Henzinger, S. Krishnan, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran, “MOCHA user manual”, Technical report, University of California at Berkeley, 2000. http://www-cad.eecs.berkeley.edu//~ mocha/doc/c-doc/c-manual.ps.gz.

  2. R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic”, in Proceeding of the 38th IEEE Symporium on Foundations of Computer Science (FOCS’97), IEEE Computer Society, October, pp. 100–109, 1997.

  3. R. Alur, T. A. Henzinger, and O. Kupferman, “ Alternating-time temporal logic”, in Proceeding of the International Symposium ‘Compositionality: The Significant Difference’ (COMPOS’97), Springer-Verlag, vol. 1536 of LNCS, pp. 23–60, 1998.

  4. R. Alur T. A. Henzinger O. Kupferman (2002) ArticleTitle“Alternating-time temporal logic” J. ACM 49 IssueID5 672–713 Occurrence Handle10.1145/585265.585270

    Article  Google Scholar 

  5. E. M. Clarke E. A. Emerson A. P. Sistla (1986) ArticleTitle“Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach” ACM Trans. Program. Lang. Sys 8 IssueID2 244–263 Occurrence Handle10.1145/5397.5399

    Article  Google Scholar 

  6. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking, MIT Press, 1999.

  7. M. Davis G. Logemann D. Loveland (1962) ArticleTitle“A machine program for theorem proving” J. ACM 5 IssueID7 394–397

    Google Scholar 

  8. V. Goranko W. Jamroga (2004) ArticleTitle“Comparing semantics of logics for multi-agent systems” Synthese/Knowl., Ration. Act 139 IssueID2 241–280

    Google Scholar 

  9. W. Jamroga, “Some remarks on alternating temporal epistemic logic”, in B. Dunin-Keplicz and R. Verbrugge, (eds.), Proceeding of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS’03), pp. 133–140, 2003.

  10. W. Jamroga W. Hoek Particlevan der (2004) ArticleTitle“Agents that know how to play” Fundamenta Informaticae 63 IssueID23 185–219

    Google Scholar 

  11. M. Kacprzak, A. Lomuscio, T. Łasica, W. Penczek, and M. Szreter, “Verifying multiagent systems via unbounded model checking”, in M. G. Hinchey, J. L. Rash, W. Truszkowski, and C. Rouff, (eds.), Proceeding of the 3rd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS’04), Springer, vol. 3228 of LNCS, pp. 189–212, 2005.

  12. M. Kacprzak, A. Lomuscio, and W. Penczek, “Unbounded model checking for knowledge and time”, Technical Report 966, ICS PAS, Ordona 21, 01-237 Warsaw, December 2003.

  13. M. Kacprzak, A. Lomuscio, and W. Penczek, “Verification of multi-agent systems via unbounded model checking”, in N. R. Jennings, C. Sierra, L. Sonenberg, and M. Tambe, (eds.), Proceeding of the 3rd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’04), ACM, vol. II, July, pp. 638–645, 2004.

  14. M. Kacprzak W. Penczek (2004) ArticleTitle“A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic” Synthese 142 203–227 Occurrence Handle10.1007/s11229-004-2446-8 Occurrence HandleMR2120945

    Article  MathSciNet  Google Scholar 

  15. M. Kacprzak and W. Penczek, “Unbounded model checking for alternating-time logic”, in N. R. Jennings, C. Sierra, L. Sonenberg, and M. Tambe, (eds.), Proceeding of the 3rd Internation Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’04), ACM, vol. II, July, pp. 646–653, 2004.

  16. A. Lomuscio, T. Łasica, and W. Penczek, “Bounded model checking for interpreted systems: Preliminary experimental results”, in Proceeding of the 2nd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS’02), volume 2699 of LNAI, Springer-Verlag, pp. 115–125, 2003.

  17. K. L. McMillan, “Applying SAT methods in unbounded symbolic model checking”, in Proceeding of the 14th International Conference on Computer Aided Verification (CAV’02), volume 2404 of LNCS, Springer-Verlag, pp. 250–264, 2002.

  18. W. Penczek A. Lomuscio (2003) ArticleTitle“Verifying epistemic properties of multi-agent systems via bounded model checking” Fundamenta Informaticae 55 IssueID2 167–167

    Google Scholar 

  19. Penczek W. and Lomuscio A., “Verifying epistemic properties of multi-agent systems via bounded model checking”, in Sandholm T., (eds.), Proceeding of the 2nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’03), ACM, pp. 209–209, (2003).

  20. Raimondi F. and Lomuscio A., “A tool for specification and verification of epistemic properties of interpreted systems”, In Proceeding of the Internastional Workshop on Logic and Communication in Multi-Agent Systems (LCMAS’03), vol. 85(2) of ENTCS, Elsevier, (2003).

  21. A. Tarski (1955) ArticleTitle“A lattice-theoretical fixpoint theorem and its applications” Pac. J. Math 5 285–309

    Google Scholar 

  22. W. van der Hoek and Wooldridge M., “Model checking knowledge and time”, In Proceeding of the 9th Internation SPIN Workshop (SPIN’02), volume 2318 of LNCS, Springer-Verlag, pp. 95–111, (2002).

  23. W. van der Hoek and Wooldridge M., “Tractable multiagent planning for epistemic goals” in Proceeding of the 1st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’02), vol. III, ACM, pp. 116-11674, (2002).

  24. W. Hoek Particlevan der M. Wooldridge (2003) ArticleTitle“Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications” Stud. Logica 75 IssueID1 125–157 Occurrence Handle10.1023/A:1026185103185

    Article  Google Scholar 

  25. W. Hoek Particlevan der M. Wooldridge (2003) ArticleTitle“Model checking cooperation, knowledge, and time a case study” Res. Econ 57 IssueID3 235–265 Occurrence Handle10.1016/S1090-9443(03)00031-0

    Article  Google Scholar 

  26. R. van der Meyden and Shilov H., “Model checking knowledge and time in systems with perfect recall”, in Proceeding of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’99), vol. 1738 of LNCS, Springer-Verlag, pp. 432–432, (1999).

  27. S. Otterloo Particlevan W. Hoek Particlevan der M. Wooldridge (2003) ArticleTitle“Knowledge as strategic ability” ENCTS 85 IssueID2 1–23

    Google Scholar 

  28. Wooldridge M., Fisher M., M. P. Huget, and Parsons S., “Model checking multiagent systems with MABLE”, in Proceeding of the 1st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’02), vol. II, ACM, pp. 952–959, (2002).

Download references

Author information

Authors and Affiliations

  1. Białystok University of Technology, Institute of Mathematics and Physics, 15-351, Białystok, Wiejska 45A, Poland

    Magdalena Kacprzak

  2. Institute of Computer Science PAS, 01-237, Warsaw, Ordona 21, Poland

    Wojciech Penczek

  3. Institute of Informatics, Podlasie Academy, 08-110, Siedlce, Sienkiewicza 51, Poland

    Wojciech Penczek

Authors
  1. Magdalena Kacprzak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Penczek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Magdalena Kacprzak.

Additional information

The authors acknowledge support from the two Polish grants: W/IMF/2/04 and 3 T11C 011 28.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kacprzak, M., Penczek, W. Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1. Auton Agent Multi-Agent Syst 11, 69–89 (2005). https://doi.org/10.1007/s10458-005-0944-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-005-0944-9

Keywords

Search

Navigation