Skip to main content
SpringerLink
Log in

Bounded Correctness Checking for Knowledge with eCTLK

  • Conference paper
  • First Online:
Book cover Geo-Spatial Knowledge and Intelligence (GSKI 2017)

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

Included in the following conference series:

  • 1119 Accesses

Abstract

Bounded semantics of LTL and that of CTL, and the characterization of these properties have been widely studied and used as the theoretical basis for SAT-based bounded model checking. This has led to a lot of successful applications with respect to error detection in the checking of LTL and CTL properties by satisfiability testing. In this paper, we further investigate bounded semantics for the extended computational tree logic with epistemic components (eCTLK) which can be applied to verification of multi-agent systems (MAS). On the theoretical aspect, we propose a bounded correctness checking algorithm for eCTLK properties that can handle both verification and falsification problems with bounded models. On the practical aspect, we apply the bounded semantics of eCTLK to derive a QBF-based characterization of eCTLK properties which is more succinct to encode symbolic model checking problems than SAT formulas.

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.P.: Principles of Model Checking. MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  2. 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 

  3. Biere, A., Cimmatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded Model Checking. Advances in Computers, vol. 58. Academic Press, Massachusetts (2003)

    Google Scholar 

  4. Huang, X., van der Meyden, R.: Symbolic Model Checking Epistemic Strategy Logic, pp. 1426–1432, AAAI (2014)

    Google Scholar 

  5. Penczek, W., Wozna, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae 51, 135–156 (2002)

    MathSciNet  MATH  Google Scholar 

  6. Oshman, R., Grumberg, O.: A new approach to bounded model checking for branching time logics. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 410–424. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75596-8_29

    Chapter  MATH  Google Scholar 

  7. Laroussinie, F., Schnoebelen, P.: Specification in CTL past for verification in CTL. Inf. Comput. 156, 236–263 (2000)

    Article  MathSciNet  Google Scholar 

  8. Inverso, O., Tomasco, E., Fischer, B., La Torre, S., Parlato, G.: Bounded model checking of multi-threaded C programs via lazy sequentialization. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 585–602. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08867-9_39

    Chapter  Google Scholar 

  9. Lomuscio, A., Penczek, W., Qu, H.: Partial order reduction for model checking interleaved multi-agent systems, pp. 659–666. AAMAS (2010)

    Google Scholar 

  10. Armando, A., Carbone, R., Compagna, L.: SATMC: A SAT-Based model checker for security-critical systems. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 31–45. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54862-8_3

    Chapter  Google Scholar 

  11. Kroening, D., Tautschnig, M.: CBMC – C bounded model checker. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389–391. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54862-8_26

    Chapter  Google Scholar 

  12. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publisher, Dordrecht (1993)

    Book  Google Scholar 

  13. Bryant, R.E.: Binary decision diagrams and beyond: enabling technologies for formal verification, pp. 236–243 ICCAD (1995)

    Google Scholar 

  14. Jussila, T., Biere, A.: Compressing BMC Encodings with QBF. Electron. Notes Theoret. Comput. Sci. BMC 174(3), 45–56 (2006)

    Article  Google Scholar 

  15. Emerson, E.A., Halpern, J.Y.: ”Sometimes” and ”Not Never” revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151–178 (1986)

    Article  MathSciNet  Google Scholar 

  16. Zhang, W.: QBF encoding of temporal properties and QBF-based verification. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 224–239. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08587-6_16

    Chapter  Google Scholar 

  17. Zhang, W.: Bounded semantics. Theoret. Comput. Sci. 564, 1–29 (2015)

    Article  MathSciNet  Google Scholar 

  18. Xu, Z., Zhang, W.: Linear templates of ACTL formulas with an application to SAT-based verification. Inf. Process. Lett. 127, 6–16 (2017)

    Article  MathSciNet  Google Scholar 

  19. Zhang, W.: Bounded semantics of CTL and SAT-Based verification. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 286–305. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10373-5_15

    Chapter  Google Scholar 

  20. Clarke, E., Kroening, D., Ouaknine, J., Strichman, O.: Computational challenges in bounded model checking. Int. J. Softw. Tools Technol. Transf. 7, 174–183 (2005)

    Article  Google Scholar 

  21. Ganai, M.K., Gupta, A.: Accelerating high-level bounded model checking. ICCAD, pp. 794–801 (2006)

    Google Scholar 

  22. Wang, B.-Y.: Proving \(\forall \mu \)-Calculus properties with SAT-based model checking. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 113–127. Springer, Heidelberg (2005). https://doi.org/10.1007/11562436_10

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  24. Ji, K.: CTL model checking in deduction modulo. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 295–310. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21401-6_20

    Chapter  Google Scholar 

  25. Kemper, S.: SAT-based verification for timed component connectors. Sci. Comput. Program. 77(7–8), 779–798 (2012)

    Article  Google Scholar 

  26. Wimmer, R., Braitling, B., Becker, B.: Counterexample generation for discrete-time markov chains using bounded model checking. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 366–380. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-93900-9_29

    Chapter  MATH  Google Scholar 

  27. Hoffmann, J., Gomes, C.P., Selman, B., Kautz, H.A.: SAT Encodings of State-Space Reachability Problems in Numeric Domains. IJCAI, pp. 1918–1923 (2007)

    Google Scholar 

  28. Duan, Z., Tian, C., Yang, M., He, J.: Bounded model checking for propositional projection temporal logic. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 591–602. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38768-5_52

    Chapter  Google Scholar 

Download references

Acknowledgements

This work is supported by Zhejiang Provincial Natural Science Foundation of China under Grant No.LY13F020009 and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences under Grant No.SYSKF1011.

Author information

Authors and Affiliations

  1. College of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, China

    Fei Pu

Authors
  1. Fei Pu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fei Pu .

Editor information

Editors and Affiliations

  1. Beijing Institute of Technology, Beijing, China

    Hanning Yuan

  2. Beijing Institute of Technology, Beijing, China

    Jing Geng

  3. Beijing Institute of Technology, Beijing, China

    Chuanlu Liu

  4. Wuhan University, Wuhan, China

    Fuling Bian

  5. Beijing Institute of Technology, Beijing, China

    Tisinee Surapunt

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pu, F. (2018). Bounded Correctness Checking for Knowledge with eCTLK. In: Yuan, H., Geng, J., Liu, C., Bian, F., Surapunt, T. (eds) Geo-Spatial Knowledge and Intelligence. GSKI 2017. Communications in Computer and Information Science, vol 848. Springer, Singapore. https://doi.org/10.1007/978-981-13-0893-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0893-2_50

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0892-5

  • Online ISBN: 978-981-13-0893-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation