Focus Game for Projection Temporal Logic

Focus game is applied to Propositional Projection Temporal Logic with infinite models (PPTL) for the satisfiability and model checking of PPTL formulas. To this end, normal form and complete normal form are introduced, and through which sub-formulas are defined for PPTL formulas. Accordingly, focus game $G(R)$ is constructed for checking the satisfiability of PPTL formula $R$; and $G(s,R)$ is built for checking whether a system with $s$ being the initial state satisfies formula $R$. Finally, complexity of the decision procedure and the model checking algorithm is analyzed.

[1]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[2]  Zhenhua Duan,et al.  An extended interval temporal logic and a framing technique for temporal logic programming , 1996 .

[3]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

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

[5]  MannaZohar,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1984 .

[6]  Pierre Wolper,et al.  Specification and synthesis of communicating processes using an extended temporal logic: (preliminary version) , 1982, POPL '82.

[7]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[8]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[9]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

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

[12]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[13]  Martin Lange,et al.  Focus games for satisfiability and completeness of temporal logic , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[14]  Benjamin Charles Moszkowski.  Reasoning about Digital Circuits , 1983 .

[15]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

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

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

[18]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

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

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

[21]  Christian Dax,et al.  Game Over: The Foci Approach to LTL Satisfiability and Model Checking , 2005, Electron. Notes Theor. Comput. Sci..

[22]  Martin Lange,et al.  Model Checking Games for Branching Time Logics , 2002, J. Log. Comput..