Skip to main content
SpringerLink
Log in

Bounded Model Checking of CTL

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Bounded Model Checking has been recently introduced as an efficient verification method for reactive systems. This technique reduces model checking of linear temporal logic to propositional satisfiability. In this paper we first present how quantified Boolean decision procedures can replace BDDs. We introduce a bounded model checking procedure for temporal logic CTL* which reduces model checking to the satisfiability of quantified Boolean formulas. Our new technique avoids the space blow up of BDDs, and extends the concept of bounded model checking.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Clarke E M, Grumberg O, Peled D. Model Checking. MIT Press, 2000.

  2. Ben-Ari M, Manna Z, Pnueli A. The temporal logic of branching time. Acta Information, 1983, 20(3): 207–226.

    Article  MATH  MathSciNet  Google Scholar 

  3. Pnueli A. A temporal logic of concurrent programs. Theoretical Computer Science, 1981, 13(1): 45–60.

    Article  MATH  MathSciNet  Google Scholar 

  4. McMillan K L. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

  5. Burch J R, Clarke E M, McMillan K L. Symbolic model checking: 1020 states and beyond. Information and Computation, 1992, 98: 142–170.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bryant R E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 1986, 35: 677–691.

    MATH  Google Scholar 

  7. Biere A, Cimatti A, Clarke E M, Zhu Y. Symbolic model checking without BDDs. In Proc. Tools and Algorithms for the Analysis and Construction of Systems (TACAS’99), LNCS 1579, Springer-Verlag, 1999, pp. 193–207.

  8. Li X W, Li G H, Shao M. Formal verification techniques based on Boolean satisfiability problem. Journal of Computer Science and Technology, 2005, 20(1): 38–47.

    Article  MathSciNet  Google Scholar 

  9. Wozna B. ACTL* properties and bounded model checking. Fundamenta Informaticae, 2004, 62(2): 1–23.

    MathSciNet  Google Scholar 

  10. Kleine Büing H, Lettmann H. Propositional Logic: Deduction and Algorithms, Cambridge University Press, 1999.

  11. Hilbert D, Ackermann W. Principles of Mathematical Logic. New York, Chelsea, 1950.

  12. Quine W V Q. Methods of Logic. Newyork: Heny Holt, 1959.

  13. Anil Nerode, Richard A Shore. Logic for Applications. Spinger, 1997.

  14. Dershowitz N, Hanna Z, Katz J. Bounded Model Checking with QBF. In Proc. International Conference on Theory and Applications of Satisfiability Testing (SAT’05), LNCS 3569, Springer-Verlag, St. Andrews, UK, 2005, pp. 408–414.

    Google Scholar 

  15. Davis M, Logemann G, Loveland D. A machine program for theorem-proving. Communications of the ACM, 1962, 5(7): 394–397.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Peking University, Beijing, 100871, China

    Zhi-Hong Tao, Zhong Chen & Li-Fu Wang

  2. Department of Mathematics, Nanjing University, Nanjing, 210093, China

    Cong-Hua Zhou

Authors
  1. Zhi-Hong Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cong-Hua Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Li-Fu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-Hong Tao.

Additional information

This work is supported by the National Grand Fundamental Research 973 Program of China (Grant No. 2002CB312006).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tao, ZH., Zhou, CH., Chen, Z. et al. Bounded Model Checking of CTL. J Comput Sci Technol 22, 39–43 (2007). https://doi.org/10.1007/s11390-007-9004-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9004-z

Keywords

Search

Navigation