Skip to main content
SpringerLink
Log in

Exponential Acceleration of Model Checking for Perfect Recall Systems

  • Conference paper
Perspectives of Systems Informatics (PSI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7162))

  • 493 Accesses

Abstract

We revise the model checking algorithm for combination of Computation Tree Logic and Propositional Logic of Knowledge in finite multiagent systems with a perfect recall synchronous semantics. A new approach is based on data structures that are exponentially smaller than the structures used in the previous versions of the model checking algorithm. It reduces the time complexity of the algorithm exponentially.

The research has been supported by Russian Foundation for Basic Research (grant 10-01-00532-a) and by Siberian Branch of Russian Academy of Science (Integration Grant n.2/12).

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. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160(1-2), 109–127 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bordini, R.H., Fisher, M., Visser, W., Wooldridge, M.: Verifying Multi-agent Programs by Model Checking. Autonomous Agents and Multi-Agent Systems 12(2), 239–256 (2006)

    Article  Google Scholar 

  3. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)

    Google Scholar 

  5. Cohen, M., Lomuscio, A.: Non-elementary speed up for model checking synchronous perfect recall. In: Proceeding of the 2010 Conference on ECAI 2010, pp. 1077–1078. IOS Press, Amsterdam (2010)

    Google Scholar 

  6. Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science, vol. B, pp. 995–1072. Elsevier and MIT Press (1990)

    Google Scholar 

  7. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press (1995)

    Google Scholar 

  8. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comp. Sci. 256(1-2), 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Garanina, N.O., Kalinina, N.A., Shilov, N.V.: Model checking knowledge, actions and fixpoints. In: Proc. of Concurrency, Specification and Programming Workshop CS&P 2004, Germany. Humboldt Universitat, Berlin (2004); Informatik-Bericht Nr. 170(2), 351–357

    Google Scholar 

  10. Halpern, J.Y., van der Meyden, R., Vardi, M.Y.: Complete Axiomatizations for Reasoning About Knowledge and Time. SIAM J. Comp. 33(3), 674–703 (2004)

    Article  MATH  Google Scholar 

  11. Huang, X., van der Meyden, R.: The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time. In: Proc. of 19th ECAI, Lisbon, Portugal, August 16-20. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 549–554. IOS Press (2010)

    Google Scholar 

  12. Kozen, D.: Results on the Propositional Mu-Calculus. Theoretical Computer Science 27(3), 333–354 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kozen, D., Tiuryn, J.: Logics of Programs. In: Handbook of Theoretical Computer Science, vol. B, pp. 789–840. Elsevier and MIT Press (1990)

    Google Scholar 

  14. Kwiatkowska, M.Z., Lomuscio, A., Qu, H.: Parallel Model Checking for Temporal Epistemic Logic. In: Proc. of 19th ECAI, Lisbon, Portugal, August 16-20. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 543–548. IOS Press (2010)

    Google Scholar 

  15. Lomuscio, A., Penczek, W., Qu, H.: Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems. In: Proc. of 9th AAMAS, Toronto, Canada, May 10-14. IFAAMAS, vol. 1, pp. 659–666 (2010)

    Google Scholar 

  16. van der Meyden, R., Shilov, N.V.: Model Checking Knowledge and Time in Systems with Perfect Recall. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Rescher, N.: Epistemic Logic. A Survey of the Logic of Knowledge. University of Pitsburgh Press (2005)

    Google Scholar 

  18. Shilov, N.V., Yi, K.: How to find a coin: propositional program logics made easy. In: Current Trends in Theoretical Computer Science, vol. 2, pp. 181–213. World Scientific (2004)

    Google Scholar 

  19. Shilov, N.V., Garanina, N.O., Choe, K.-M.: Update and Abstraction in Model Checking of Knowledge and Branching Time. Fundameta Informaticae 72(1-3), 347–361 (2006)

    MathSciNet  MATH  Google Scholar 

  20. Shilov, N.V., Garanina, N.O.: Well-Structured Model Checking of Multiagent Systems. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 363–376. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, Russian Academy of Science, 6, Lavrentiev Ave., 630090, Novosibirsk, Russia

    Natalia O. Garanina

Authors
  1. Natalia O. Garanina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, 15213-3891, Pittsburgh, PA, USA

    Edmund Clarke

  2. A.P. Ershov Institute of Informatics Systems Siberian Branch of the Russian Academy of Sciences, 6, Acad. Lavrentiev ave, Novosibirsk, 630090, Russia

    Irina Virbitskaite

  3. The University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garanina, N.O. (2012). Exponential Acceleration of Model Checking for Perfect Recall Systems. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2011. Lecture Notes in Computer Science, vol 7162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29709-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29709-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29708-3

  • Online ISBN: 978-3-642-29709-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation