A decision procedure for propositional projection temporal logic with infinite models

Authors:
Zhenhua Duan;Cong Tian;Li Zhang
Affiliations:
Xidian University, Institute of Computing Theory and Technology, 710071, Xi’an, People’s Republic of China;Xidian University, Institute of Computing Theory and Technology, 710071, Xi’an, People’s Republic of China;Xidian University, Institute of Computing Theory and Technology, 710071, Xi’an, People’s Republic of China
Venue:
Acta Informatica
Year:
2008

Citing 0
Cited 18

A Unified Model Checking Approach with Projection Temporal Logic

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Complexity of propositional projection temporal logic with star†

Mathematical Structures in Computer Science
A note on stutter-invariant PLTL

Information Processing Letters
Generalized Russian Cards Problem

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Integrating top-down and scenario-based methods for constructing software specifications

Information and Software Technology
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
Categorial semantics of a solution to distributed dining philosophers problem

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Axiomatic semantics of projection temporal logic programs†

Mathematical Structures in Computer Science
An improved decision procedure for propositional projection temporal logic

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Alternating interval based temporal logics

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A transformation from PPTL to S1S

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Expressiveness of propositional projection temporal logic with star

Theoretical Computer Science
Compositional verification with stutter-invariant propositional projection temporal logic

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Pre-post notation is questionable in effectively specifying operations of object-oriented systems

Frontiers of Computer Science in China
A cylinder computation model for many-core parallel computing

Theoretical Computer Science
A complete proof system for propositional projection temporal logic

Theoretical Computer Science
Some fixed-point issues in PPTL

Theories of Programming and Formal Methods
Verification and enforcement of access control policies

Formal Methods in System Design

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 given. To this end, Normal Form (NF) and Labeled Normal Form Graph (LNFG) for PPTL formulas are defined, and algorithms for transforming a formula to its normal form and constructing the LNFG for the given formula are presented. Further, the finiteness of LNFGs is proved in details. Moreover, the decision procedure is extended to check the satisfiability of the formulas of Propositional Interval Temporal Logic. In addition, examples are also given to illustrate how the decision procedure works.