Timed propositional temporal logic

In model checking, a field of computer science, timed propositional temporal logic (TPTL) is an extension of propositional linear temporal logic (LTL) in which variables are introduced to measure times between two events. For example, while LTL allows to state that each event p is eventually followed by an event q, TPTL furthermore allows to give a time limit for q to occur.

Syntax

The future fragment of TPTL is defined similarly to linear temporal logic, in which furthermore, clock variables can be introduced and compared to constants. Formally, given a set X of clocks, MTL[clarification needed] is built up from:

Furthermore, for I=(a,b) an interval, x∈I is considered as an abbreviation for x>a∧x<b; and similarly for every other kind of intervals.

The logic TPTL+Past is built as the future fragment of TLS[clarification needed] and also contains

The next operator N[clarification needed] is not considered to be a part of MTL[clarification needed] syntax. It will instead be defined from other operators.

A closed formula is a formula over an empty set of clocks.[clarification needed]

Models

Let T⊆ℝ+, which intuitively represents a set of times. Let γ:T→𝒫(AP) a function that associates to each moment t∈T a set of propositions from AP. A model of a TPTL formula is such a function γ. Usually, γ is either a timed word or a signal. In those cases, T is either a discrete subset or an interval containing 0.

Semantics

Let T and γ be as above. Let X be a set of clocks. Let ν:X→ℝ≥0 (a clock valuation over X).

We are now going to explain what it means for a TPTL formula ϕ to hold at time t for a valuation ν. This is denoted by γ,t,ν⊨ϕ. Let ϕ and ψ be two formulas over the set of clocks X, ξ a formula over the set of clocks X∪{y}, x∈X, l∈𝙰𝙿, c a number and ∼ being a comparison operator such as <, ≤, =, ≥ or >: We first consider formulas whose main operator also belongs to LTL:

Metric temporal logic

Metric temporal logic is another extension of LTL that allows measurement of time. Instead of adding variables, it adds an infinity of operators 𝒰I and 𝒮I for I an interval of non-negative numbers. The semantics of the formula ϕ𝒰ℐψ at some time t is essentially the same than the semantics of the formula ϕ𝒰ψ, with the constraints that the time t″ at which ψ must hold occurs in the interval t+I.

TPTL is as least as expressive as MTL. Indeed, the MTL formula ϕ𝒰ℐψ is equivalent to the TPTL formula x.ϕ(x∈I∧ψ) where x is a new variable.

It follows that any other operator introduced in the page MTL, such as ◻ and ◊ can also be defined as TPTL formulas.

TPTL is strictly more expressive than MTL: 2  both over timed words and over signals. Over timed words, no MTL formula is equivalent to ◻(a⟹x.◊(b∧◊(c∧x≤5))). Over signal, there are no MTL formula equivalent to x.◊(a∧x≤1∧◻(x≤1⟹¬b)), which states that the last atomic proposition before time point 1 is an a.

Comparison with LTL

A standard (untimed) infinite word w=a0,a1,…, is a function from ℕ to A. We can consider such a word using the set of time T=ℕ, and the function γ(i)=ai. In this case, for ϕ an arbitrary LTL formula, w,i⊨ϕ if and only if γ,i,ν⊨ϕ, where ϕ is considered as a TPTL formula with non-strict operator, and ν is the only function defined on the empty set.