Skip to main content
SpringerLink
Log in

A Framework for Model Checking Against CTLK Using Quantified Boolean Formulas

  • Conference paper
  • First Online:
Formal Techniques for Safety-Critical Systems (FTSCS 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1165))

  • 252 Accesses

Abstract

We present a novel bounded model checking (BMC) tool chain for multi-agent systems. This framework automatically translates the verification of system models against properties formulated in computation tree logics with epistemic modalities (CTLK) into quantified Boolean formulas (QBFs). Our framework exploits recent QBF technology for solving those verification problems and for certifying the result, making the implementation of a dedicated CTLK solver obsolete. The translation to QBF is based on existing theoretical work and implemented in our novel tool which extends the open-source model checker MCMAS. First experimental results are very promising and indicate the practical feasibility of our approach. Furthermore we provide novel benchmarks to the QBF community.

This work was supported by the Austrian FWF grant W1255-N23 and the LIT AI Lab funded by the State of Upper Austria.

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 EPUB and 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

References

  1. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  2. Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010. Technical report, FMV Reports Series, Inst. FMV, JKU Linz, Austria (2010)

    Google Scholar 

  3. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49059-0_14

    Chapter  Google Scholar 

  4. Biere, A., Heljanko, K., Wieringa, S.: AIGER 1.9 and beyond. Technical report, FMV Reports Series, Inst. FMV, JKU Linz, Austria (2011)

    Google Scholar 

  5. Clarke, E.M., Grumberg, O., Kroening, D., Peled, D., Veith, H.: Model Checking. MIT press, Cambridge (2018)

    MATH  Google Scholar 

  6. Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-10575-8

    Book  MATH  Google Scholar 

  7. Dershowitz, N., Hanna, Z., Katz, J.: Bounded model checking with QBF. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 408–414. Springer, Heidelberg (2005). https://doi.org/10.1007/11499107_32

    Chapter  Google Scholar 

  8. Dorri, A., Kanhere, S.S., Jurdak, R.: Multi-agent systems: a survey. IEEE Access 6, 28573–28593 (2018)

    Article  Google Scholar 

  9. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (2003)

    MATH  Google Scholar 

  10. van der Hoek, W., Wooldridge, M.J.: Tractable multiagent planning for epistemic goals. In: AAMAS, pp. 1167–1174. ACM (2002)

    Google Scholar 

  11. Jordan, C., Klieber, W., Seidl, M.: Non-CNF QBF solving with QCIR. In: AAAI Workshop: Beyond NP, vol. WS-16-05. AAAI Press (2016)

    Google Scholar 

  12. 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). https://doi.org/10.1007/978-3-642-02658-4_55

    Chapter  Google Scholar 

  13. Lomuscio, A., Raimondi, F.: The complexity of model checking concurrent programs against CTLK specifications. In: Baldoni, M., Endriss, U. (eds.) DALT 2006. LNCS (LNAI), vol. 4327, pp. 29–42. Springer, Heidelberg (2006). https://doi.org/10.1007/11961536_3

    Chapter  Google Scholar 

  14. MCMAS-QBF (2019). http://fmv.jku.at/ftscs19

  15. Tentrup, L.: Non-prenex QBF solving using abstraction. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 393–401. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40970-2_24

    Chapter  Google Scholar 

  16. Zhou, C., Chen, Z., Tao, Z.: QBF-based symbolic model checking for knowledge and time. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 386–397. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72504-6_35

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Formal Models and Verification, Johannes Kepler University Linz, Linz, Austria

    Emily Yu, Martina Seidl & Armin Biere

Authors
  1. Emily Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martina Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Armin Biere
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emily Yu .

Editor information

Editors and Affiliations

  1. National University of Sciences and Technology, Islamabad, Pakistan

    Osman Hasan

  2. Université Cote d'Azur, Sophia Antipolis Cedex, France

    Frédéric Mallet

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yu, E., Seidl, M., Biere, A. (2020). A Framework for Model Checking Against CTLK Using Quantified Boolean Formulas. In: Hasan, O., Mallet, F. (eds) Formal Techniques for Safety-Critical Systems. FTSCS 2019. Communications in Computer and Information Science, vol 1165. Springer, Cham. https://doi.org/10.1007/978-3-030-46902-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-46902-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-46901-6

  • Online ISBN: 978-3-030-46902-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation