Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2013: Computing and Combinatorics pp 591–602Cite as

Bounded Model Checking for Propositional Projection Temporal Logic

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7936))

Abstract

This paper presents a bounded model checking approach for propositional projection temporal logic (PPTL). To this end, first PPTL is briefly introduced. Then, bounded semantics of PPTL is defined according to its semantics in logic theory. Further, a reduction method from BMC to SAT is given in detail. In addition, an example is presented to illustrate how the approach works. Our experience shows that BMC approach for PPTL proposed in the paper is useful and feasible.

This research is supported by the NSFC Grant No. 61003078, 61133001, and 61272117, 973 Program Grant No. 2010CB328102 and ISN Lab Grant No. ISN1102001.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Pnueli, A.: The Temporal Logic of Programs. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46–67. IEEE, New York (1977)

    Google Scholar 

  3. Biere, A., Clarke, E., et al.: Bounded Model checking. Advances in Computers, vol. 58, pp. 117–148. Academic Press, London (2003)

    Google Scholar 

  4. Liu, C.L., Layland, J.W.: Scheduling algorithm for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  5. Tian, C., Duan, Z.: Model Checking Propositional Projection Temporal Logic based on SPIN. In: Butler, M., Hinchey, M.G., Larrondo-Petrie, M.M. (eds.) ICFEM 2007. LNCS, vol. 4789, pp. 246–265. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Clarke, E., Kroening, D., et al.: Computational Challenges in Bounded Model Checking. International Journal on Software Tools for Technology Transfer 7(2), 174–183 (2005)

    Article  Google Scholar 

  7. Clark, E., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  8. Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., Vardi, M.Y.: Benefits of Bounded Model Checking at an Industrial Setting. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 436–453. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Holzmann, G.J.: SPIN Model Checker: The Primer and Reference Manual (September 4, 2003)

    Google Scholar 

  10. http://www.cs.cmu.edu/~modelcheck/bmc.html

  11. Quielle, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  12. Burch, J.R., Clarke, E., McMillan, K.L., Dill, D.L., Hwang, J.: Symbolic Model Checking: 1020 States and Beyond. Information and Computation 98(2), 142–170 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. McMillian, K.L.: Symbolic Model Checking. Kluwer Academic Publishers (1993) ISBN: 0-7923-9380-5

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Huth, M., Ryan, M.: Logic in Computer Science: Modeling and Reasoning about Systems, 2nd edn., Part 3. China Machine Press (2007) ISBN:978-7-111-21397-0

    Google Scholar 

  16. Moszkowski, B.: Reasoning about digital circuits. Ph.D. Thesis. Stanford University, Stanford (1983)

    Google Scholar 

  17. Grumberg, O., Long, D.E.: Model checking and modular verification. Journal ACM Transactions on Programming Languages and Systems TOPLAS Homepage Archive 16(3), 843–871 (1994)

    Article  Google Scholar 

  18. Tian, C., Duan, Z.: Propositional projection temporal logic, Bωchi automata and ω-regular expressions. In: Agrawal, M., et al. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 47–58. Springer, Heidelberg (2008)

    Chapter  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)

    Chapter  Google Scholar 

  20. http://www.cs.cmu.edu/~modelcheck/bmc.html

  21. Duan, Z.: An Extended Interval Temporal Logic and a Framing Technique for Temporal Logic Programming. Ph.D. Thesis, University of Newcastle upon Tyne (May 1996)

    Google Scholar 

  22. Duan, Z., Tian, C., Zhang, L.: A Decision Procedure for Propositional Projection Temporal Logic with Infinite Models. Acta Informatica 45(1), 43–78 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Duan, Z., Zhang, L.: A Decision Procedure for Propositional Projection Temporal Logic. Technical Report No.1, Institute of Computing Theory and Technology, Xidian University, Xi’an P.R.China (2005)

    Google Scholar 

  24. Duan, Z., Yang, X., Kounty, M.: Framed Temporal Logic Programming. Science of Computer Programming 70(1), 31–61 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICTT and ISN Lab, Xidian University, Xi’an, 710071, P.R. China

    Zhenhua Duan, Cong Tian & Jia He

  2. China Academy of Space Technology, Beijing, 100094, P.R. China

    Mengfei Yang

Authors
  1. Zhenhua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cong Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mengfei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jia He
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

  2. College of Computer Science and Technology, Zhejiang University, 310027, Hangzhou, China

    Guochuan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duan, Z., Tian, C., Yang, M., He, J. (2013). Bounded Model Checking for Propositional Projection Temporal Logic. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38768-5_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38767-8

  • Online ISBN: 978-3-642-38768-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation