Skip to main content
SpringerLink
Log in

Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic

  • Conference paper
Distributed Computing and Artificial Intelligence

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 217))

Abstract

We tackle two symbolic approaches to bounded model checking (BMC) for an existential fragment of the soft real-time epistemic computation tree logic (RTECTLK) interpreted over interleaved interpreted systems. We describe a BDD-based BMC method for RTECTLK, and provide its experimental evaluation and comparison with a SAT-based BMC method. Moreover, we have attempted a comparison with MCMAS on several benchmarks.

Partly supported by National Science Center under the grant No. 2011/01/B/ST6/05317.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Campos, S.: A quantitative approach to the formal verification of real-time systems. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, USA (1996)

    Google Scholar 

  2. Cohen, M., Dam, M., Lomuscio, A., Qu, H.: A data symmetry reduction technique for temporal-epistemic logic. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 69–83. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Cohen, M., Dam, M., Lomuscio, A., Russo, F.: Abstraction in model checking multi-agent systems. In: Proc. of AAMAS 2009, vol. 2, pp. 945–952. IFAAMAS (2009)

    Google Scholar 

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

    MATH  Google Scholar 

  5. van der Hoek, W., Wooldridge, M.J.: Model checking knowledge and time. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 95–111. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Jones, A.V., Lomuscio, A.: Distributed BDD-based BMC for the verification of multi-agent systems. Proc. of AAMAS 2010, 675–682. IFAAMAS (2010)

    Google Scholar 

  7. Kacprzak, M., Lomuscio, A., Łasica, T., Penczek, W., Szreter, M.: Verifying multi-agent systems via unbounded model checking. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A. (eds.) FAABS 2004. LNCS (LNAI), vol. 3228, pp. 189–212. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Kacprzak, M., Nabialek, W., Niewiadomski, A., Penczek, W., Pólrola, A., Szreter, M., Woźna, B., Zbrzezny, A.: VerICS 2007 - a model checker for knowledge and real-time. Fundamenta Informaticae 85(1-4), 313–328 (2008)

    MATH  MathSciNet  Google Scholar 

  9. Lomuscio, A., Penczek, W., Qu, H.: Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems. Fundamenta Informaticae 101(1-2), 71–90 (2010)

    MATH  MathSciNet  Google Scholar 

  10. Lomuscio, A., Penczek, W., Woźna, B.: Bounded model checking for knowledge and real time. Artificial Intelligence 171, 1011–1038 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lomuscio, A., Qu, H., Raimondi, F.: McMAS: A model checker for the verification of multi-agent systems. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 682–688. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Męski, A., Penczek, W., Szreter, M.: BDD-based Bounded Model Checking for LTLK over Two Variants of Interpreted Systems. Proc. of LAM 2012, 35–50 (2012)

    Google Scholar 

  13. van der Meyden, R., Shilov, N.: 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 

  14. Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55(2), 167–185 (2003)

    MATH  MathSciNet  Google Scholar 

  15. Penczek, W., Woźna-Szcześniak, B., Zbrzezny, A.: Towards SAT-based BMC for LTLK over interleaved interpreted systems. Fundamenta Informaticae 119(3-4), 373–392 (2012)

    MATH  MathSciNet  Google Scholar 

  16. Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied Logic 5(2), 235–251 (2005)

    Article  MathSciNet  Google Scholar 

  17. Wooldridge, M.: An introduction to multi-agent systems. John Wiley, England (2002)

    Google Scholar 

  18. Woźna-Szcześniak, B., Zbrzezny, A.: SAT-based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems. In: Baldoni, M., Dennis, L., Mascardi, V., Vasconcelos, W. (eds.) DALT 2012. LNCS, vol. 7784, pp. 170–189. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Woźna-Szcześniak, B.z., Zbrzezny, A., Zbrzezny, A.: The BMC method for the existential part of RTCTLK and interleaved interpreted systems. In: Antunes, L., Pinto, H.S. (eds.) EPIA 2011. LNCS (LNAI), vol. 7026, pp. 551–565. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Łódź, FMCS, Banacha 22, 90-238, Łódź, Poland

    Artur Męski

  2. ICS PAS, J. Kazimierza 5, 01-237, Warsaw, Poland

    Artur Męski

  3. Jan D ługosz University, IMCS, Armii Krajowej 13/15, 42-200, Częstochowa, Poland

    Bożena Woźna-Szcześniak, Agnieszka M. Zbrzezny & Andrzej Zbrzezny

Authors
  1. Artur Męski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bożena Woźna-Szcześniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Agnieszka M. Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrzej Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artur Męski .

Editor information

Editors and Affiliations

  1. Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan

    Sigeru Omatu

  2. Department of Computing Science, University of Minho, Braga, Portugal

    José Neves

  3. Dept. of Computing Science and Control, University of Salamanca, Salamanca, Spain

    Juan M. Corchado Rodriguez

  4. Department of Computing Science, University of Salamanca, Salamanca, Spain

    Juan F Paz Santana

  5. Department of Computing Science, University of Salamanca, Salamanca, Spain

    Sara Rodríguez Gonzalez

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Męski, A., Woźna-Szcześniak, B., Zbrzezny, A.M., Zbrzezny, A. (2013). Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic. In: Omatu, S., Neves, J., Rodriguez, J., Paz Santana, J., Gonzalez, S. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent Systems and Computing, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-00551-5_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-00551-5_58

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-00550-8

  • Online ISBN: 978-3-319-00551-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation