A transformation from PPTL to S1S

Authors:
Cong Tian;Zhenhua Duan
Affiliations:
Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China;Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 14
Cited 0

Reasoning about infinite computations

Information and Computation
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
A Decision Algorithm for Full Propositional Temporal Logic

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Compositional reasoning about projected and infinite time

ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Reasoning about digital circuits

Reasoning about digital circuits
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
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
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.01

Visualization

Abstract

A transformation from Propositional Projection Temporal Logic (PPTL) as well as Propositional Interval Temporal Logic (PITL) with infinite models to monadic second order logic with one successor (S1S) is presented in this paper. To this end, intervals where PPTL and PITL formulas are interpreted over are represented as I-structures. Further, the semantics of PPTL and PITL formulas are redefined over I-structures. Moreover, according to I-structure semantics, a PPTL or PITL formula is translated to a formula in S1S. As a result, many mature theoretical and technical results, such as decidability etc. for S1S can be easily inherited by PPTL and PITL.