Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computational Logic in Multi-Agent Systems

CLIMA 2006: Computational Logic in Multi-Agent Systems pp 134–150Cite as

Representing and Verifying Temporal Epistemic Properties in Multi-Agent Systems

  • Conference paper

  • 309 Accesses

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

Abstract

In this paper, we present a temporal epistemic logic, called μTEL, which generalizes μ-calculus by introducing knowledge modality and cooperation modality. Similar to μ-calculus, μTEL is a succinct and expressive language. It is showed that temporal modalities such as “always”, “sometime” and “until”, and knowledge modalities such as “everyone knows” and “common knowledge” can be expressed in such a logic. Furthermore, we study the model checking technique and its complexity. Finally, we use μTEL and its model checking algorithm to study the well-known trains and controller problem.

This work was supported by the National Natural Science Foundation of China under Grant 60473036.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: The Control of Synchronous Systems Part II. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, Springer, Heidelberg (2001)

    Google Scholar 

  3. de Alfaro, L., Henzinger, T.A., Majumdar, R.: From Verification to Control: Dynamic Programs for Omega-Regular Objectives. In: LICS 01, 16th International IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  4. de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: The Control of Synchronous Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Alur, R., de Alfaro, L., Henzinger, T.A., Krishnan, S.C., Mang, F.Y.C., Qadeer, S., Rajamni, S.K., Tasiran, S.: MOCHA user manual. University of Berkeley Report (2000)

    Google Scholar 

  6. Alur, R., Henzinger, T.A.: Alternating-time temporal logic. In Journal of the ACM 49(5), 672–713

    Google Scholar 

  7. Arnold, A., Niwinski, D.: Rudiments of μ-calculus. Studies in Logic, vol. 146. North-Holland, Amsterdam (2001)

    Book  Google Scholar 

  8. Bourahla, M., Benmohamed, M.: Model Checking Multi-Agent Systems. Informatica 29, 189–197 (2005)

    MATH  Google Scholar 

  9. Bradfield, J., Stirling, C.: Modal Logics and mu-Calculi: An Introduction. In: Handbook of Process Algebra, Elsevier Science B.V, Amsterdam (2001)

    Google Scholar 

  10. Clarke, E.M., Grumberg, J.O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)

    Google Scholar 

  11. van Ditmarsch, H., van der Hoek, W., Kooi, B.P.: Dynamic Epistemic Logic with Assignment. In: AAMAS05, vol. 1, pp. 141–148. ACM, New York (2005)

    Google Scholar 

  12. Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for fragments of the μ-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)

    Google Scholar 

  13. Fagin, R., Halpern, J.Y.: Reasoning about knowledge and probability. Journal of the ACM 41(2), 340–367 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  15. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Common knowledge revisited. Annals of Pure and Applied Logic 96, 89–105 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Fellows, M.R., Koblitz, N.: Self-witnessing polynimial-time complexity and prime factorization. In: Proceedings of the 7th Annal Conference on Structure in Complexity Theory, pp. 107–110. IEEE Computer Society Press, Los Alamitos (1992)

    Chapter  Google Scholar 

  17. Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of Alternating-time temporal logic. Theoretical Computer Science 353, 93–117 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Halpern, J.Y.: Reasoning about knowledge: a survey. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 4, pp. 1–34. Oxford University Press, Oxford (1995)

    Google Scholar 

  19. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. van der Hoek, W., Wooldridge, M.: Model Checking Knowledge, and Time. In: Bošnački, D., Leue, S. (eds.) Model Checking Software. LNCS, vol. 2318, pp. 95–111. Springer, Heidelberg (2002)

    Google Scholar 

  21. van der Hoek, W., Wooldridge, M.: Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications. Studia Logica 75, 125–157 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. van der Hoek, W., Wooldridge, M.: On the Logic of Cooperation and Propositional Control. Artificial Intelligence 64(1-2), 81–119 (2005)

    Google Scholar 

  23. Jurdzinski, M.: Deciding the winner in parity games is in UP∩co-UP. Information Processing Letters 68, 119–134 (1998)

    Article  MathSciNet  Google Scholar 

  24. Jurdzinski, M., Paterson, M., Zwick, U., Deterministic, A.: Subexponential Algorithm for Solving Parity Games. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, ACM Press, New York (Jan. 2006)

    Google Scholar 

  25. Kacprzak, M., Lomuscio, A., Penczek, W.: Verification of multiagent systems via unbounded model checking. In: Proceedings of the 3rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS-04) (2004)

    Google Scholar 

  26. Konikowska, B., Penczek, W.: Model Checking for Multivalued Logic of Knowledge and Time. In: AAMAS06, pp. 169–176 (2006)

    Google Scholar 

  27. McMillan, K.L.: Symbolic model checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  28. Walukiewicz, I.: Completeness of Kozen’s axiomatisation of the propositional μ-calculus. Information and Computation 157, 142–182 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wooldridge, M., Fisher, M., Huget, M., Parsons, S.: Model checking multiagent systems with mable. In: Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-02) (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Nanjing University of Aero. & Astro., Nanjing 210016, China

    Zining Cao

Authors
  1. Zining Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Katsumi Inoue Ken Satoh Francesca Toni

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Cao, Z. (2007). Representing and Verifying Temporal Epistemic Properties in Multi-Agent Systems. In: Inoue, K., Satoh, K., Toni, F. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2006. Lecture Notes in Computer Science(), vol 4371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69619-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69619-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69618-6

  • Online ISBN: 978-3-540-69619-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation