Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Rough Sets

IJCRS 2017: Rough Sets pp 487–504Cite as

Simple SMT-Based Bounded Model Checking for Timed Interpreted Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10314))

Abstract

The paper deals with symbolic approach to bounded model checking (BMC) for metric temporal logic with epistemic operators (MTLK) that is interpreted over timed interpreted systems (\(\mathrm{{TIS}}\)). We present an SMT-based BMC method based on the translation of MTLK formulae to \({\mathrm{{\mathrm{LTL}}}_\mathrm{q}\mathrm {K}}\) formulae. We show how to implement the bounded model checking technique for \({\mathrm{{\mathrm{LTL}}}_\mathrm{q}\mathrm {K}}\) logic and timed interpreted systems, and we present full translation to SMT problem for \({\mathrm{{\mathrm{LTL}}}_\mathrm{q}\mathrm {K}}\). As a case study, we apply the technique in the analysis of the Timed Generic Pipeline Paradigm modelled by TIS. We also present the differences between the old translation of MTLK and the new one. The theoretical description is supported by the experimental results that demonstrate the efficiency of the method.

Partly supported by National Science Centre under the grant No. 2014/15/N/ST6/05079.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. 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). doi:10.1007/3-540-49059-0_14

    Chapter  Google Scholar 

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

    Google Scholar 

  3. Dutertre, B.: Yices 2.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737–744. Springer, Cham (2014). doi:10.1007/978-3-319-08867-9_49

    Google Scholar 

  4. Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science. Formal Methods and Semantics, vol. B, pp. 995–1067. Elsevier (1990)

    Google Scholar 

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

    MATH  Google Scholar 

  6. Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. i. lower bounds. J. Comput. Syst. Sci. 38(1), 195–237 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Syst. 2(4), 255–299 (1990)

    Article  Google Scholar 

  8. De Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78800-3_24

    Chapter  Google Scholar 

  9. Męski, A., Penczek, W., Szreter, M., Woźna-Szcześniak, B., Zbrzezny, A.: BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Auton. Agent. Multi-Agent Syst. 28(4), 558–604 (2014)

    Article  Google Scholar 

  10. Wooldridge, M.: An Introduction to Multi-agent Systems, 2nd edn. Wiley, Hoboken (2009)

    Google Scholar 

  11. Woźna-Szcześniak, B., Zbrzezny, A.: Checking EMTLK properties of timed interpreted systems via bounded model checking. Stud. Logica. 104(4), 641–678 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zbrzezny, A.: A new translation from ECTL\(^*\) to SAT. Fundam. Informaticae 120(3–4), 377–397 (2012)

    MathSciNet  MATH  Google Scholar 

  13. Zbrzezny, A.M., Zbrzezny, A.: Simple bounded MTL model checking for discrete timed automata (extended abstract). In: Proceedings of CS&P 2016, pp. 37–48 (2016)

    Google Scholar 

  14. Zbrzezny, A.M., Zbrzezny, A.: Simple bounded MTLK model checking for timed interpreted systems. In: Jezic, G., Kusek, M., Chen-Burger, Y.-H.J., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2017. SIST, vol. 74, pp. 88–98. Springer, Cham (2018). doi:10.1007/978-3-319-59394-4_9

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMCS, Jan Długosz University, Al. Armii Krajowej 13/15, 42-200, Czȩstochowa, Poland

    Agnieszka M. Zbrzezny & Andrzej Zbrzezny

Authors
  1. Agnieszka M. Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Agnieszka M. Zbrzezny .

Editor information

Editors and Affiliations

  1. Polish-Japanese Academy of Information Technology, Warsaw, Poland

    Lech Polkowski

  2. University of Regina, Regina, Saskatchewan, Canada

    Yiyu Yao

  3. University of Warmia and Mazury, Olsztyn, Poland

    Piotr Artiemjew

  4. University of Milano-Bicocca, Milano, Italy

    Davide Ciucci

  5. Southwest Jiaotong University, Chengdu, China

    Dun Liu

  6. Warsaw University, Warszawa, Poland

    Dominik Ślęzak

  7. Silesian University, Sosnowiec, Poland

    Beata Zielosko

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Zbrzezny, A.M., Zbrzezny, A. (2017). Simple SMT-Based Bounded Model Checking for Timed Interpreted Systems. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10314. Springer, Cham. https://doi.org/10.1007/978-3-319-60840-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60840-2_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60839-6

  • Online ISBN: 978-3-319-60840-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation