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.

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 {\displaystyle X} of clocks, MTL^{[clarification needed]} is built up from:

• a finite set of propositional variables AP,
• the logical operators ¬ and ∨, and
• the temporal modal operator U,
• a clock comparison x ∼ c {\displaystyle x\sim c} , with x ∈ X {\displaystyle x\in X} , c {\displaystyle c} a number and ∼ {\displaystyle \sim } a comparison operator such as <, ≤, =, ≥ or >.^{[clarification needed]}
• a freeze quantification operator x . ϕ {\displaystyle x.\phi } , for ϕ {\displaystyle \phi } a TPTL formula with set of clocks X ∪ { x } {\displaystyle X\cup \{x\}} .

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

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

• the temporal modal operator S.

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.^{[2][clarification needed]}

Let T ⊆ R + {\displaystyle T\subseteq \mathbb {R} _{+}} , which intuitively represents a set of times. Let γ : T → P ( A P ) {\displaystyle \gamma :T\to {\mathcal {P}}(AP)} a function that associates to each moment t ∈ T {\displaystyle t\in T} a set of propositions from AP. A model of a TPTL formula is such a function γ {\displaystyle \gamma } . Usually, γ {\displaystyle \gamma } is either a timed word or a signal. In those cases, T {\displaystyle T} is either a discrete subset or an interval containing 0.

Let T {\displaystyle T} and γ {\displaystyle \gamma } be as above. Let X {\displaystyle X} be a set of clocks. Let ν : X → R ≥ 0 {\displaystyle \nu :X\to \mathbb {R} _{\geq 0}} (a clock valuation over X {\displaystyle X} ).

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

• γ , t , ν ⊨ l {\displaystyle \gamma ,t,\nu \models l} holds if l ∈ γ ( t ) {\displaystyle l\in \gamma (t)} ,
• γ , t , ν ⊨ ¬ ϕ {\displaystyle \gamma ,t,\nu \models \neg \phi } holds if γ , t , ν ⊭ ϕ {\displaystyle \gamma ,t,\nu \not \models \phi }
• γ , t , ν ⊨ ϕ ∨ ψ {\displaystyle \gamma ,t,\nu \models \phi \lor \psi } holds if either γ , t , ν ⊨ ϕ {\displaystyle \gamma ,t,\nu \models \phi } or γ , t , ν ⊨ ψ {\displaystyle \gamma ,t,\nu \models \psi } , or both
• γ , t , ν ⊨ ϕ U ψ {\displaystyle \gamma ,t,\nu \models \phi \mathbin {\mathcal {U}} \psi } holds if there exists t ″ {\displaystyle t''} such that t < t ″ {\displaystyle t<t''} and γ , t ″ , ν ⊨ ψ {\displaystyle \gamma ,t'',\nu \models \psi } and for each t ′ {\displaystyle t'} with t < t ′ < t ″ {\displaystyle t<t'<t''} ,   γ , t ′ , ν ⊨ ϕ {\displaystyle \gamma ,t',\nu \models \phi } ,
• γ , t , ν ⊨ ϕ S ψ {\displaystyle \gamma ,t,\nu \models \phi \mathbin {\mathcal {S}} \psi } holds if there exists t ″ {\displaystyle t''} such that t ″ < t {\displaystyle t''<t} and γ , t ″ , ν ⊨ ψ {\displaystyle \gamma ,t'',\nu \models \psi } and for each t ′ {\displaystyle t'} with t ″ < t ′ < t {\displaystyle t''<t'<t} ,   γ , t ′ , ν ⊨ ϕ {\displaystyle \gamma ,t',\nu \models \phi } ,
• γ , t , ν ⊨ x ∼ c {\displaystyle \gamma ,t,\nu \models x\sim c} holds if t − ν ( y ) ∼ c {\displaystyle t-\nu (y)\sim c} ,^{[clarification needed]}
• γ , t , ν ⊨ y . ξ {\displaystyle \gamma ,t,\nu \models y.\xi } holds if γ , t , ν [ y → t ] ⊨ ϕ {\displaystyle \gamma ,t,\nu [y\to t]\models \phi } holds.^{[clarification needed]}

Metric temporal logic is another extension of LTL that allows measurement of time. Instead of adding variables, it adds an infinity of operators U I {\displaystyle {\mathcal {U}}_{I}} and S I {\displaystyle {\mathcal {S}}_{I}} for I {\displaystyle I} an interval of non-negative numbers. The semantics of the formula ϕ U I ψ {\displaystyle \phi \mathbin {\mathcal {U_{I}}} \psi } at some time t {\displaystyle t} is essentially the same than the semantics of the formula ϕ U ψ {\displaystyle \phi \mathbin {\mathcal {U}} \psi } , with the constraints that the time t ″ {\displaystyle t''} at which ψ {\displaystyle \psi } must hold occurs in the interval t + I {\displaystyle t+I} .

TPTL is as least as expressive as MTL. Indeed, the MTL formula ϕ U I ψ {\displaystyle \phi \mathbin {\mathcal {U_{I}}} \psi } is equivalent to the TPTL formula x . ϕ ( x ∈ I ∧ ψ ) {\displaystyle x.\phi {\mathcal {(}}x\in I\land \psi )} where x {\displaystyle x} is a new variable.^[2]

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

TPTL is strictly more expressive than MTL^[1]: 2 both over timed words and over signals. Over timed words, no MTL formula is equivalent to ◻ ( a ⟹ x . ◊ ( b ∧ ◊ ( c ∧ x ≤ 5 ) ) ) {\displaystyle \Box (a\implies x.\Diamond (b\land \Diamond (c\land x\leq 5)))} . Over signal, there are no MTL formula equivalent to x . ◊ ( a ∧ x ≤ 1 ∧ ◻ ( x ≤ 1 ⟹ ¬ b ) ) {\displaystyle x.\Diamond (a\land x\leq 1\land \Box (x\leq 1\implies \neg b))} , which states that the last atomic proposition before time point 1 is an a {\displaystyle a} .

A standard (untimed) infinite word w = a 0 , a 1 , … , {\displaystyle w=a_{0},a_{1},\dots ,} is a function from N {\displaystyle \mathbb {N} } to A {\displaystyle A} . We can consider such a word using the set of time T = N {\displaystyle T=\mathbb {N} } , and the function γ ( i ) = a i {\displaystyle \gamma (i)=a_{i}} . In this case, for ϕ {\displaystyle \phi } an arbitrary LTL formula, w , i ⊨ ϕ {\displaystyle w,i\models \phi } if and only if γ , i , ν ⊨ ϕ {\displaystyle \gamma ,i,\nu \models \phi } , where ϕ {\displaystyle \phi } is considered as a TPTL formula with non-strict operator, and ν {\displaystyle \nu } is the only function defined on the empty set.