Skip to main content

Temporal Verification of Probabilistic Multi-Agent Systems

  • Chapter
Pillars of Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4800))

Abstract

Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of actions. We show how such systems can be polynomially transformed to finite state Markov chains. This allows one to transfer known results on verifying temporal properties of the finite state Markov chains to the probabilistic multi-agent systems of the considered type.

This work was sponsored by the Russian Fundamental Studies Foundation (Grants 07-01-00637-a and 08-01-00241-a).

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. Apt, K.R.: Logic programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Formal Models and Semantics, ch. 10, vol. B, pp. 493–574. Elsevier Science Publishers B.V, Amsterdam (1990)

    Google Scholar 

  2. Aziz, A., et al.: It usually works: The temporal logic of stochastic systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 155–165. Springer, Heidelberg (1995)

    Google Scholar 

  3. Barringer, H., et al.: METATEM: An Introduction. Formal Aspects of Computing 7, 533–549 (1995)

    Article  MATH  Google Scholar 

  4. Bordini, R., et al.: Model checking AgentSpeak. In: AAMAS 2003, pp. 409–416 (2003)

    Google Scholar 

  5. Benerecetti, M., Guinchiglia, F., Serafini, L.: Model checking multiagent systems. Technical Report # 9708-07. Instituto Trentino di Cultura (1998)

    Google Scholar 

  6. Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press, Cambridge (2000)

    Google Scholar 

  7. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857–907 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dekhtyar, M., Dikovsky, A., Valiev, M.: On feasible cases of checking multi-agent Systems Behavior. Theoretical Computer Science 303(1), 63–81 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dekhtyar, M.I., Dikovsky, A.Ja., Valiev, M.K.: On complexity of verification of interacting agents’ behavior. Annals of Pure and Applied Logic 141, 336–362 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dix, J., Nanni, M., Subrahmanian, V.S.: Probabilistic agent reasoning. ACM Transactions of Computational Logic 1(2), 201–245 (2000)

    MathSciNet  Google Scholar 

  11. Giordano, L., Martelli, A., Schwind, C.: Verifying communication agents by model checking in a temporal action Logic. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 57–69. Springer, Heidelberg (2004)

    Google Scholar 

  12. Hansson, H., Jonsson, B.: A logic for reasning about time and reliability. Formal Aspects of Computing 6(5), 512–535 (1994)

    Article  MATH  Google Scholar 

  13. Marta, K.: Model Checking for probability and time: from theory to practice. In: Proc. 18th IEEE Symposium on Logic in Computer Science, pp. 351–360 (2003)

    Google Scholar 

  14. Rao, A.S., Georgeff, M.P.: Modeling rational agents within a BDI architecture. In: Proc. 2nd Intern. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufman Publishers, San Francisco (1991)

    Google Scholar 

  15. Shoham, Y.: Agent oriented programming. Artificial Intelligence 60, 51–92 (1993)

    Article  MathSciNet  Google Scholar 

  16. Subrahmanian, V.S., Bonatti, P., Dix, J., et al.: Heterogeneous agent systems. MIT Press, Cambridge (2000)

    Google Scholar 

  17. van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: AAMAS 2002, Bologna, Italy (2002)

    Google Scholar 

  18. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pp. 327–338. IEEE, New York

    Google Scholar 

  19. Wooldridge, M., Dunne, P.E.: The Computational complexity of Agent Verification. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol. 2333, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Wooldridge, M., et al.: Model Checking Multiagent systems with MABLE. In: Proc. of the First Intern. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2002), Bologna, Italy (July 2002)

    Google Scholar 

  21. Wooldridge, M., Jennings, N.: Intelligent agents: Theory and practice. The Knowledge Engineering Review 10(2) (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arnon Avron Nachum Dershowitz Alexander Rabinovich

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dekhtyar, M.I., Dikovsky, A.J., Valiev, M.K. (2008). Temporal Verification of Probabilistic Multi-Agent Systems . In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78127-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78126-4

  • Online ISBN: 978-3-540-78127-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics