Skip to main content
SpringerLink
Log in
Book cover

Computer and Information Science 2009 pp 273–283Cite as

A Proof System for Projection Temporal Logic

  • Chapter

  • 590 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 208))

Abstract

This paper presents a proof system for projection temporal logic (PTL) over finite domains. To this end, the syntax and semantics of PTL are briefly presented; a set of axioms and inference rules is formalized; also some theorems are summarized and proved. Further, an example is given to illustrate how the axioms and rules work.

This research is supported by the NSFC Grant No. 60433010 and No. 60873018, DPRP No. 51315050105, SRFDP 200807010012, and SKLSE 20080713.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bledsoe, W., Loveland, D.: Automating Theorem Proving: After 25 Years. Amer Mathematical Society, USA (1984)

    Google Scholar 

  2. Clarke, E., Emerson, E.: Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic. Logic of Programs, 52–71 (1981)

    Google Scholar 

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

    Google Scholar 

  4. Duan, Z., Tian, C., Zhang, L.: A decision procedure for propositional projection temporal logic with infinite models. Acta Inf. 45(1), 43–78 (2008)

    Google Scholar 

  5. Duan, Z., Yang, X., Koutny, M.: Framed temporal logic programming. Sci. Comput. Program. 70(1), 31–61 (2008)

    Google Scholar 

  6. Duan, Z., Tian, C.: A Unified Model Checking Approach with Projection Temporal Logic. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 167–186. Springer, Heidelberg (2008)

    Google Scholar 

  7. Dutertre, B.: Complete proof systems for first order interval temporal logic. In: Proc. 10th LICS, pp. 36–43. IEEE Computer Society, Los Alamitos (1995)

    Google Scholar 

  8. Guelev, D.P.: A Complete Proof System for First-order Interval Temporal Logic with Projection. Journal of Logic and Computation 14(2), 215–249 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kesten, Y., Pnueli, A.: A Complete Proof Systems for QPTL. In: LICS 1995, pp. 2–12 (1995)

    Google Scholar 

  10. McMillan, K.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publisher, Dordrecht (1993)

    Google Scholar 

  11. Moszkowski, B.: Executing temporal logic programs. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  12. Moszkowski, B.: A complete axiomatization of interval temporal logic with infinite time. In: LICS 2000, pp. 241–252 (2000)

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Theory and Technology, Xidian University, Xi’an, 710071, P.R.China

    Zhenhua Duan

  2. Xi’an Institute of Posts and Telecommunications, Xi’an, 710121, P.R.China

    Xinfeng Shu

  3. State Key Laboratory of Software Engineering, Wuhan University, Wuhan, 430072, P.R.China

    Xinfeng Shu

Authors
  1. Zhenhua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinfeng Shu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Engineering & Information, Technology Institute, Central Michigan University, MI 48859, Mt. Pleasant, U.S.A.

    Roger Lee

  2. Department of Computer Science, Central Michigan University, MI 48859, Mt. Pleasant, U.S.A.

    Gongzu Hu

  3. School of Computer Engineering and Science, Shanghai University, Shanghai, China

    Huaikou Miao

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Duan, Z., Shu, X. (2009). A Proof System for Projection Temporal Logic. In: Lee, R., Hu, G., Miao, H. (eds) Computer and Information Science 2009. Studies in Computational Intelligence, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01209-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01209-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01208-2

  • Online ISBN: 978-3-642-01209-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation