skip to main content
10.1145/544862.544965acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Model checking multi-agent systems with MABLE

Published:15 July 2002Publication History

ABSTRACT

MABLE is a language for the design and automatic verification of multi-agent systems. MABLE is essentially a conventional imperative programming language, enriched by constructs from the agent-oriented programming paradigm. A MABLE system contains a number of agents, programmed using the MABLE imperative programming language. Agents in MABLE have a mental state consisting of beliefs, desires and intentions. Agents communicate using request and inform performatives, in the style of the fipa agent communication language. MABLE systems may be augmented by the addition of formal claims about the system, expressed using a quantified, linear temporal belief-desire-intention logic. MABLE has been fully implemented, and makes use of the spin model checker to automatically verify the truth or falsity of claims.

References

  1. M. Benerecetti, F. Giunchiglia, and L. Serafini. Model checking multi-agent systems. Journal of Logic and Computation, 8(3):401--424, 1998Google ScholarGoogle ScholarCross RefCross Ref
  2. B. Chellas. Modal Logic: An Introduction. Cambridge University Press: Cambridge, England, 1980Google ScholarGoogle ScholarCross RefCross Ref
  3. W. F. Clocksin and C. S. Mellish. Programming in Prolog. Springer-Verlag: Berlin, Germany, 1981 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. R. Cohen and H. J. Levesque. Intention is choice with commitment. Artificial Intelligence, 42:213--261, 1990 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. R. Cohen and H. J. Levesque. Rational interaction as the basis for communication. In P. R. Cohen, J. Morgan, and M. E. Pollack, editors, Intentions in Communication, pages 221--256. The MIT Press: Cambridge, MA, 1990Google ScholarGoogle Scholar
  6. E. A. Emerson and J. Y. Halpern. 'Sometimes' and 'not never' revisited: on branching time versus linear time temporal logic. Journal of the ACM, 33(1):151--178, 1986 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. The MIT Press: Cambridge, MA, 1995 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. The Foundation for Intelligent Physical Agents. See http://www.fipa.org/Google ScholarGoogle Scholar
  9. David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. The MIT Press: Cambridge, MA, 2000 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. K. V. Hindriks, F. S. de Boer, W. van der Hoek, and J.-J. Ch. Meyer. Agent programming in 3APL. Autonomous Agents and Multi-Agent Systems, 2(4):357--402, 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall International: Hemel Hempstead, England, 1991 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Holzmann. The Spin model checker. IEEE Transaction on Software Engineering, 23(5):279--295, May 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Y. Lésperance, H. J. Levesque, F. Lin, D. Marcu, R. Reiter, and R. B. Scherl. Foundations of a logical approach to agent programming. In M. Wooldridge, J. P. Müller, and M. Tambe, editors, Intelligent Agents II (LNAI Vol. 1037), pages 331--346. Springer-Verlag: 1996Google ScholarGoogle Scholar
  14. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag: Berlin, Germany, 1992 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems --- Safety. Springer-Verlag: Berlin, Germany, 1995 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. S. Rao. AgentSpeak(L): BDI agents speak out in a logical computable language. In W. Van de Velde and J. W. Perram, editors, Agents Breaking Away: Proc. Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World, (LNAI Vol. 1038), pages 42--55. Springer-Verlag: 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. S. Rao and M. Georgeff. Decision procedures for BDI logics. Journal of Logic and Computation, 8(3):293--344, 1998Google ScholarGoogle ScholarCross RefCross Ref
  18. A. S. Rao and M. P. Georgeff. An abstract architecture for rational agents. In C. Rich, W. Swartout, and B. Nebel, editors, Proc. Knowledge Representation and Reasoning, pages 439--449, 1992Google ScholarGoogle Scholar
  19. Y. Shoham. Agent-oriented programming. Artificial Intelligence, 60(1):51--92, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. G. Winskel. The Formal Semantics of Programming Languages. The MIT Press: Cambridge, MA, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Wooldridge. Computationally grounded theories of agency. In Proc. Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 13--20, Boston, MA, 2000 Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Wooldridge. Reasoning about Rational Agents. The MIT Press: Cambridge, MA, 2000Google ScholarGoogle Scholar
  23. M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115--152, 1995Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Model checking multi-agent systems with MABLE

        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
        • Published in

          cover image ACM Conferences
          AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
          July 2002
          508 pages
          ISBN:1581134800
          DOI:10.1145/544862

          Copyright © 2002 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 15 July 2002

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate1,155of5,036submissions,23%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader