Metric interval temporal logic explained

In model checking, the Metric Interval Temporal Logic (MITL) is a fragment of Metric Temporal Logic (MTL). This fragment is often preferred to MTL because some problems that are undecidable for MTL become decidable for MITL.

Definition

A MITL formula is an MTL formula, such that each set of reals used in subscript are intervals, which are not singletons, and whose bounds are either a natural number or are infinite.

Difference from MTL

MTL can express a statement such as the sentence S: "P held exactly ten time units ago". This is impossible in MITL. Instead, MITL can say T: "P held between 9 and 10 time units ago". Since MITL can express T but not S, in a sense, MITL is a restriction of MTL which allows only less precise statements.

Problems that MITL avoids

One reason to want to avoid a statement such as S is that its truth value may change an arbitrary number of times in a single time unit. Indeed, the truth value of this statement may change as many times as the truth value of P changes, and P itself may change an arbitrary number of time in a single time unit.

Let us now consider a system, such as a timed automaton or a signal automaton, which want to know at each instant whether S holds or not. This system should recall everything that occurred in the last 10 time units. As seen above, it means that it must recall an arbitrarily large number of events. This can not be implemented by a system with finite memory and clocks.

Bounded variability

One of the main advantage of MITL is that each operator has the bounded variability property. Example:

Given the statement T defined above. Each time the truth value of T switches from false to true, it remains true for at least one time unit. Proof: At a time t where T becomes true, it means that:

• between 9 and 10 time units ago, P was true.
• just before time t, P was false.

Hence, P was true exactly 9 time units ago. It follows that, for each

t'\in[ 0 , 1 ] , at time t + t' , P was true 9+ t' time units ago. Since 9+ t'\in[ 9 , 10 ] , at time t' , T holds.

A system, at each instant, wants to know the value of T. Such a system must recall what occurred during the last ten time units. However, thanks to the bounded variability property, it must recall at most 10 time units when T becomes true. And hence 11 times when T becomes false. Thus this system must recall at most 21 events, and hence can be implemented as a timed automaton or a signal automaton.

Examples

Examples of MITL formulas:

\square\diamond _{(0,1)} p states that the letter p appears at least once in each open interval of length 1.\triangleright _{\{i\} }p where \triangleright _{\{i\} }p is the prophecy operator defined as \square _{(0,i)} \neg p\land\diamond _{(0,i]} p and which states that the first occurrence of p in the future is in i time unit.p\land\square(p\implies\triangleright _{\{1\} }p) states that p holds exactly at each integral time and not anytime else.

Fragments

Safety-MTL_0,∞

The fragment Safety-MTL_0,v is defined as the subset of MITL_0,∞ containing only formulas in positive normal form where the interval of every until operator has an upper bound. For example, the formula

\Box(a\implies\Diamond _{(0,1]} b) which states that each a is followed, less than one time unit later, by a b , belongs to this logic.^[1]

Open and closed MITL

The fragment Open-MTL contains the formula in positive normal form such that:

• for each

l U _{I} , I is open, and

• for each

l R _{I} , I is closed.

The fragment Closed-MITL contains the negation of formulas of Open-MITL.

Flat and Coflat MITL

The fragment Flat-MTL contains the formula in positive normal form such that:

• for each

\phi _{1lU} _{I\phi} _{2} , if I is unbounded, then \phi _{1} is a LTL-formula

• for each

\phi _{1lR} _{I\phi} _{2} , if I is unbounded, then \phi _{2} is a LTL-formula

The fragment Coflat-MITL contains the negation of formulas of Flat-MITL.

Non-strict variant

Given any fragment L, the fragment L^ns is the restriction of L in which only non strict operators are used.

MITL_0,∞ and MITL₀

Given any fragment L, the fragment L_0,∞ is the subset of L where the lower bound of each interval is 0 or the upper bound is infinity. Similarly we denote by L₀ (respectively, L_∞) the subset of L such that the lower bound of each interval is 0 (respectively, the upper bound of each interval is ∞).

Expressiveness over signals

Over signals, MITL₀ is as expressive as MITL. This can be proven by applying the following rewriting rules to a MITL formula.^[2]

\phi l U _{(a,b)} \psi is equivalent to \Box _{(0,a]} \phi l U\psi\land\Diamond _{(a,b)} \psi (the construction for half-closed and closed intervals is similar).\Diamond _{(a,b)} \phi is equivalent to \Diamond _{(2a-b,a)} \Box _{(0,b-a)} \Diamond _{(0,b-a)} \phi if 2 a - b\ge 0 .\Diamond _{(a,b)} \phi is equivalent to \Diamond _{(a,b-a)} \Diamond _{(0,a)} \phi if a<b .\Diamond _{(a,+infty)} \phi is equivalent to \Box _{(0,a)} \Diamond\phi .

Applying those rewriting rules exponentially increases the size of the formula. Indeed, the numbers

a and b are traditionally written in binary, and those rules should be applied O\left( (b)/(b - a) \right) times.

Expressiveness over timed words

Contrary to the case of signals, MITL is strictly more expressive than MITL_0,∞. The rewriting rules given above do not apply in the case of timed words because, in order to rewrite

\Diamond _{(a,b)} the assumption must be that some event occurs between times 0 and a , which is not necessarily the case.

Satisfiability problem

The problem of deciding whether a MITL formula is satisfiable over a signal is in PSPACE-complete.^[3]

References needed

R. Alur, T. Feder, and T.A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM, 43(1):116–146, 1996.R. Alur and T.A. Henzinger. Logics and Models of Real-Time: A Survey. In Proc. REX Workshop, Real-time: Theory in Practice, pages 74–106. LNCS 600, Springer, 1992.T.A. Henzinger. It's about Time: Real-time Logics Reviewed. In Proc. CONCUR'98, pages 439–454. LNCS 1466, Springer, 1998.

References

1. Bulychev. Peter. David. Alexandre. Larsen. Kim G.. Guangyuan. Li. June 2014. Efficient controller synthesis for a fragment of MTL_0,∞. Acta Informatica. 51. 3–4. 166. 10.1007/s00236-013-0189-z. 253779696 .
2. Book: Bersani. Marcello. Rossi. Matteo. San Pietro. Pierluigi. 2013 20th International Symposium on Temporal Representation and Reasoning . A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic . 2013. 20. 202. 10.1109/TIME.2013.20. https://re.public.polimi.it/retrieve/handle/11311/964235/49639/BersaniEtAl-CLTLocTool-ActaInf.pdf. 11311/964235. 978-1-4799-2240-6 . free.
3. Book: Henzinger. T.A.. Raskin. J.F.. Schobbens. P.-Y.. Automata, Languages and Programming . The regular real-time languages . Lecture Notes in Computer Science . 1998. 1443. 591. 10.1007/BFb0055086. 978-3-540-64781-2 .