An improved decision procedure for propositional projection temporal logic

Authors:
Zhenhua Duan;Cong Tian
Affiliations:
Institute of Computing Theory & Technology and ISN Laboratory, Xidian University, Xi'an, China;Institute of Computing Theory & Technology and ISN Laboratory, Xidian University, Xi'an, China
Venue:
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Year:
2010

Citing 10
Cited 0

The formal semantics of programming languages: an introduction

The formal semantics of programming languages: an introduction
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
A decision procedure for propositional projection temporal logic with infinite models

Acta Informatica
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of propositional projection temporal logic with star†

Mathematical Structures in Computer Science
The Büchi complementation saga

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of 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

A new decision procedure for Propositional Projection Temporal Logic (PPTL) is proposed which is an improvement to the decision procedure given in [4]. The main contribution of the paper is as follows: (1) the relationship between paths in the NFG of a formula R and its models is established and proved; (2) a new Labeled NFG (LNFG) with a set of labels (propositions) is defined; (3) given a formula R, an LNFG of R can be generated by the new decision algorithm, and all models of R can be found; (4) based on the new decision procedure, an improved model checking algorithm is presented and implemented.