Skip to main content
SpringerLink
Log in

Model Checking Knowledge and Time in Systems with Perfect Recall

(Extended Abstract)

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1738))

Abstract

This paper studies model checking for the modal logic of knowledge and linear time in distributed systems with perfect recall. It is shown that this problem (1) is undecidable for a language with operators for until and common knowledge, (2) is PSPACE-complete for a language with common knowledge but without until, (3) has nonelementary upper and lower bounds for a language with until but without common knowledge. Model checking bounded knowledge depth formulae of the last of these languages is considered in greater detail, and an automata-theoretic decision procedure is developed for this problem, that yields a more precise complexity characterization.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science, pages 1–11, Stanford, CA, 1960. Stanford Univ. Press. 437, 440

    Google Scholar 

  2. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Cambridge, MA, 1999. 432

    Google Scholar 

  3. E. Clarke, S. Jha, and W. Marrero. A machine checkable logic of knowledge for specifying security properties of electronic commerce protocols. In LICS Workshop on Formal Methods and Security Protocols, 1998. 444

    Google Scholar 

  4. R. Fagin, J. Y. H alpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MI T Press, 1995. 432, 433, 433, 435, 444

    Google Scholar 

  5. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Knowledge-based programs. Distributed Computing, 10(4):199–225, 1997. 444

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Y. Halpern and M.Y. Vardi. The complexity of reasoning about knowledge and time: synchronous systems.Research Report RJ 6097, IBM, 1988. 443

    Google Scholar 

  8. J. Y. Halpern and M.Y. Vardi. The complexity of reasoning about knowledge and time, I: lower bounds. Journal of Computer and Systems Science, 38(1):195–237, 1989. 443

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Y. Halpern and M.Y. Vardi. Model checking vs.the orem proving: a manifesto.In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation (Papers in Honor of John McCarthy), pages 151–176. Academic Press, San Diego, Calif., 1991. 433

    Google Scholar 

  10. A.R. Meyer. The inherent complexity of theories of ordered sets. In Proc. of the Int. Congr. of Mathematics, volume 2, pages 477–482, Vancouver, 1974. Canadian Mathematical Congress. 437

    Google Scholar 

  11. R. van der Meyden.Common knowledge and update in finite environments. Information and Computation, 140(2):115–157, 1998. 433, 433, 433, 433, 436, 436, 437, 437, 438, 438, 439, 439, 439, 439

    Article  MATH  MathSciNet  Google Scholar 

  12. Z. Manna and A. Pnueli. The Temporal logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1991. 432

    MATH  Google Scholar 

  13. R. van der Meyden and M.Y. Vardi. Synthesis from knowledge-based specifications. I n Proc. CONCUR’98, 9th International Conf. on Concurrency Theory, pages 34–49. Springer LNCS No. 1466, 1998. 443, 444

    Chapter  Google Scholar 

  14. A.Z. Sistla and E.M. Clark. The complexity of propositional linear temporal logic. Journal of the ACM, 32(3):733–749, 1985. 443

    Article  MATH  Google Scholar 

  15. W. Thomas. Infinite trees and automaton-definable relations over ω-words. Theoretical Computer Science, 103:143–159, 1992. 433, 437, 437, 437

    Article  MATH  MathSciNet  Google Scholar 

  16. M.Y. Vardi. Implementing knowledge-based programs. In Proc. of the Conf. on Theoretical Aspects of Rationality and Knowledge, pages 15–30, San Mateo, CA, 1996. Morgan Kaufmann. 433, 444

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of New South Wales, Sydney, 2052, Australia

    Ron van der Meyden

  2. Institute of Informatics Systems, Novosibirsk, 6, Lavrent’ev av., Novosibirsk, 630090, Russia

    Nikolay V. Shilov

Authors
  1. Ron van der Meyden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolay V. Shilov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Meyden, R., Shilov, N.V. (1999). Model Checking Knowledge and Time in Systems with Perfect Recall. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation