Home > Papers

 
 
Decision Procedure for Propositional Projection Temporal Logic with Infinite Models
Duan Zhenhua *,Tian Cong
Xidian University
*Correspondence author
#Submitted by
Subject:
Funding: 教育部博士点基金(No.20030701015)
Opened online:16 November 2006
Accepted by: none
Citation: Duan Zhenhua,Tian Cong.Decision Procedure for Propositional Projection Temporal Logic with Infinite Models[OL]. [16 November 2006] http://en.paper.edu.cn/en_releasepaper/content/9625
 
 
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 NFGs for PPTL formulas is presented. In addition, examples are also given to illustrate how the decision algorithm works.
Keywords:interval temporal logic, satisfiability, infinite model, model checking, decision procedure
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 488
Bookmarked 0
Recommend 5
Comments Array
Submit your papers