Complexity of propositional projection temporal logic with star
From MaRDI portal
Publication:3616217
DOI10.1017/S096012950800738XzbMath1161.03008MaRDI QIDQ3616217
Publication date: 24 March 2009
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
A temporal programming model with atomic blocks based on projection temporal logic ⋮ A cylinder computation model for many-core parallel computing ⋮ A canonical form based decision procedure and model checking approach for propositional projection temporal logic ⋮ Efficient decision procedure for propositional projection temporal logic ⋮ Expressiveness of propositional projection temporal logic with star ⋮ A novel algorithm for intrusion detection based on RASL model checking ⋮ Verify heaps via unified model checking ⋮ A note on stutter-invariant PLTL ⋮ Verifying safety critical task scheduling systems in PPTL axiom system ⋮ A novel approach to verifying context free properties of programs ⋮ A formal proof of the deadline driven scheduler in PPTL axiomatic system
Cites Work
- Process logic: Expressiveness, decidability, completeness
- A calculus of durations
- Completeness of temporal logics over infinite intervals.
- Framed temporal logic programming
- A decision procedure for propositional projection temporal logic with infinite models
- A lattice-theoretical fixpoint theorem and its applications
- Temporal logic can be more expressive
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection
- Decidability of Propositional Projection Temporal Logic with Infinite Models
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
