One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past

09/10/2018
by   Luca Geatti, et al.
0

In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Timed Propositional Temporal Logic (TPTL) is a real-time temporal logic, with an EXPSPACE-complete satisfiability problem, which has been successfully applied to the verification of real-time systems. In contrast to LTL, adding past operators to TPTL makes the satisfiability problem for the resulting logic (TPTL+P) non-elementary. In this paper, we devise a one-pass and tree-shaped tableau for both TPTL and bounded TPTL+P (TPTLb+P), a syntactic restriction introduced to encode timeline-based planning problems, which recovers the EXPSPACE-complete complexity. The tableau systems for TPTL and TPTLb+P are presented in a unified way, being very similar to each other, providing a common skeleton that is then specialised to each logic. In doing that, we characterise the semantics of TPTLb+P in terms of a purely syntactic fragment of TPTL+P, giving a translation that embeds the former into the latter. Soundness and completeness of the system are proved fully. In particular, we give a greatly simplified model-theoretic completeness proof, which sidesteps the complex combinatorial argument used by known proofs for the one-pass and tree-shaped tableau systems for LTL and LTL+P.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2021

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

Adding propositional quantification to the modal logics K, T or S4 is kn...
research
02/16/2019

Timeline-based planning: Expressiveness and Complexity

Timeline-based planning is an approach originally developed in the conte...
research
05/20/2021

Generalizing Non-Punctuality for Timed Temporal Logic with Freeze Quantifiers

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL...
research
12/03/2017

The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics

Let L be some extension of classical propositional logic. The non-iterat...
research
04/22/2023

The Logic of Prefixes and Suffixes is Elementary under Homogeneity

In this paper, we study the finite satisfiability problem for the logic ...
research
07/05/2014

The Complexity of Reasoning with FODD and GFODD

Recent work introduced Generalized First Order Decision Diagrams (GFODD)...

Please sign up or login with your details

Forgot password? Click here to reset