Decidability of propositional projection temporal logic with infinite models

Authors:
Zhenhua Duan;Cong Tian
Affiliations:
Institute of Computing Theory and Technology, Xidian University, Xi'an, P.R. China;Institute of Computing Theory and Technology, Xidian University, Xi'an, P.R. China
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 11
Cited 3

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking

Symbolic Model Checking
Projection in Temporal Logic Programming

LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A Combination of Clausal and Non Clausal Temporal Logic Programs

IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Axiomatization of Interval Temporal Logic with Infinite Time

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reasoning about digital circuits

Reasoning about digital circuits
Completeness of temporal logics over infinite intervals

Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
A framed temporal logic programming language

Journal of Computer Science and Technology
Semantics of framed temporal logic programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Complexity of propositional projection temporal logic with star†

Mathematical Structures in Computer Science
Model checking propositional projection temporal logic based on SPIN

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Propositional projection temporal logic, Büchi automata and ω-regular expressions

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the satisfiability of Propositional Projection Temporal Logic (PPTL) with infinite models. A decision procedure for PPTL formulas is formalized. To this end, Normal Form (NF) and Normal Form Graph (NFG) for PPTL formulas are defined and an algorithm constructing NFG for PPTL formulas is presented. Further, examples are also given to illustrate how the decision algorithm works.