Skip to main content

Modeling Multi-Agent Systems as Labeled Transitions Systems: A Unifying Approach

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5559))

Abstract

In this paper, labeled transition systems are proposed as a unifying approach to deal with the semantics of a multi-agent system. The presented model represents a multi-agent system by a triplet consisting of a set of states, a set of actions and a set of all possible system executions. We argue that notions that appear with different and complex forms in the literature such as possible world semantics, Petri nets, and process calculus can be described in the same formal framework namely transition systems. Besides, the advantages related to the use of transition system based model are enumerated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weiss, G.: Multiagent Systems A Modern approach To Distributed Artificial Intelligence. MIT Press, Cambridge (1999)

    Google Scholar 

  2. Jennings, N.R., Sycara, K., Wooldridge, M.: A Roadmap of Agent Research Development. Autonomous Agents and Multi-Agent Systems 1, 7–38 (1998)

    Article  Google Scholar 

  3. Arnold, A.: Systèmes de transitions finis et sémantique des processus communicants. Techniques et Sciences Informatiques Journal 9(3), 193–216 (1990)

    MathSciNet  Google Scholar 

  4. Hintikka, J.: Knowledge and Belief. Cornell University Press, Ithaca (1962)

    MATH  Google Scholar 

  5. Murata, T.: Petri Nets: Properties, Analysis and Applications. Proc. IEEE 77(4) (April 1989)

    Google Scholar 

  6. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  MATH  Google Scholar 

  7. Chainbi, W.: An Ontology Based Multi-Agent System Conceptual Model. Special Issue of the International Journal of Computer Applications in Technology 31(1/2), 35–44 (2008)

    Article  Google Scholar 

  8. Chainbi, W.: Belief-Goal-Role agents versus BDI agents. In: 2nd Pacific Rim International conference on Multiagents (PRIMA 1999), Kyoto (1999)

    Google Scholar 

  9. Wooldridge, M.: This is MYWORLD: The Logic of An Agent-Oriented DAI Testbed. In: Wooldridge, M.J., Jennings, N.R. (eds.) ECAI 1994 and ATAL 1994. LNCS(LNAI), vol. 890. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  10. Cohen, P.R., Levesque, H.J.: Intention is Choice with Commitment. Artificial Intelligence 42, 213–261 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kripke, S.: Semantical analysis of modal logic. Zeitshcrift für Mathematische Logik und Grundlagen der Mathematik 9, 67–96 (1963)

    Article  MATH  Google Scholar 

  12. Chainbi, W.: Multi-Agent Systems: A Petri Net with Objects Based Approach. In: Proc. of the 2004 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Beijing, China, September 20-24 (2004)

    Google Scholar 

  13. Cranefield, S., Purvis, M.: Ontologies for Interaction Protocols. In: Proc. of the 2nd International Workshop on Ontologies in Agent Systems, AAMAS 2002, Bologna, Italy, July 15-19 (2002)

    Google Scholar 

  14. Kinny, D.: The Ψ calculus: An algebraic agent language. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS, vol. 2333, pp. 32–50. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Sumpter, D.J.T., Blanchard, G.B., Broomhead, D.S.: Ants and Agents: a Process Algebra Approach to Modeling Ant Colony Behavior. Bulletin of Mathematical Biology 63, 961–980 (2001)

    Article  MATH  Google Scholar 

  16. Vasconcelos, W.W.: Logic Based Electronic Institutions. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds.) DALT 2003. LNCS(LNAI), vol. 2990, pp. 221–242. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Gelfond, M., Lifschitz, V.: Action Languages. Electronic Transactions on Artificial Intelligence 2, 193–210 (1998)

    MathSciNet  Google Scholar 

  18. Dicky, A., Arnold, A.: Equivalencies and Preorders of Transition Systems. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 20–31. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chainbi, W. (2009). Modeling Multi-Agent Systems as Labeled Transitions Systems: A Unifying Approach. In: HÃ¥kansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01665-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01664-6

  • Online ISBN: 978-3-642-01665-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics