A complete proof system for propositional projection temporal logic

The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To facilitate proofs, some of the frequently used theorems are proved. A normal form of PPTL formulas is presented, and the soundness and completeness of the proof system are demonstrated. To show how the axiom system works, a full omega regular property for the mutual exclusion problem is specified by a PPTL formula and then a deductive proof of the property is performed.

[1]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[2]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[3]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[4]  Barbara Paech,et al.  Gentzen-Systems for Propositional Temporal Logics , 1988, CSL.

[5]  Maciej Koutny,et al.  Projection in Temporal Logic Programming , 1994, LPAR.

[6]  Howard Bowman,et al.  A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection , 2003, J. Log. Comput..

[7]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.

[8]  Shinji Kono,et al.  A Combination of Clausal and Non Clausal Temporal Logic Programs , 1993, Executable Modal and Temporal Logics.

[9]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[10]  Amir Pnueli,et al.  A complete proof systems for QPTL , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[11]  Fred Krögr Temporal Logic Of Programs , 1987 .

[12]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[13]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[14]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[15]  Ben C. Moszkowski Some Very Compositional Temporal Properties , 1994, PROCOMET.

[16]  Zhenhua Duan,et al.  An Improved Decision Procedure for Propositional Projection Temporal Logic , 2010, ICFEM.

[17]  Pierre Wolper,et al.  Temporal logic can be more expressive , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Bishop Brock,et al.  ACL2 Theorems About Commercial Microprocessors , 1996, FMCAD.

[19]  Zhenhua Duan,et al.  Operational semantics of Framed Tempura , 2008, J. Log. Algebraic Methods Program..

[20]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[21]  Maciej Koutny,et al.  Framed temporal logic programming , 2008, Sci. Comput. Program..

[22]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[23]  Zhenhua Duan,et al.  Model Checking Propositional Projection Temporal Logic Based on SPIN , 2007, ICFEM.

[24]  Zhen-HuaDuan,et al.  A Framed Temporal Logic Programming Language , 2004 .

[25]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[26]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[27]  Amir Pnueli,et al.  Complete Proof System for QPTL , 2002, J. Log. Comput..

[28]  Zhenhua Duan,et al.  Complexity of propositional projection temporal logic with star , 2009, Math. Struct. Comput. Sci..

[29]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[30]  Amir Pnueli,et al.  A Deductive Proof System for CTL , 2002, CONCUR.

[31]  Maciej Koutny,et al.  Semantics of Framed Temporal Logic Programs , 2005, ICLP.

[32]  Mordechai Ben-Ari,et al.  Principles of concurrent and distributed programming , 2005, PHI Series in computer science.

[33]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[34]  Martín Abadi An Axiomatization of Lamport's Temporal Logic of Actions , 1990, CONCUR.

[35]  Ben C. Moszkowski,et al.  Compositional reasoning about projected and infinite time , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[36]  Howard Barringer,et al.  Temporal Logic with Fixed Points , 1987, Temporal Logic in Specification.

[37]  M Holcombe,et al.  A logic for biological systems. , 2000, Bio Systems.

[38]  W. Bledsoe,et al.  Automated Theorem Proving: After 25 Years , 1984 .

[39]  Amir Pnueli,et al.  A Choppy Logic , 1986, LICS.

[40]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[41]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[42]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[43]  Ben C. Moszkowski,et al.  Executing temporal logic programs , 1986, Seminar on Concurrency.

[44]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[45]  Li Zhang,et al.  A decision procedure for propositional projection temporal logic with infinite models , 2008, Acta Informatica.