|
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 |
|