Timed word

In model checking, a subfield of computer science, a timed word is an extension of the notion of words, in a formal language, in which each letter is associated with a positive time tag. The sequence of time tags must be non-decreasing, which intuitively means that letters are received. For example, a system receiving a word over a network may associate to each letter the time at which the letter is received. The non-decreasing condition here means that the letters are received in the correct order.

A timed language is a set of timed words.

Example

Consider an elevator. What is formally called a letter could be in fact information such as "someone pressed the button on the 2nd floor", or "the doors opened on the third floor". In this case, a timed word is a sequence of actions taken by the elevators and its users, with time stamps to recall those actions. The timed word can then be analyzed by formal methods to check whether a property such as "each time the elevator is called, it arrives in less than three minutes assuming that no one held the door for more than fifteen seconds" holds. A statement such as this one is usually expressed in metric temporal logic, an extension of linear temporal logic that allows the expression of time constraints.

A timed word may be passed to a model, such as a timed automaton, which will decide, given the letters or actions that already occurred, what is the next action that should be done. In our example, to which floor the elevator must go. Then a program may test this timed automaton and check the above-mentioned property. That is, it will try to generate a timed word in which the door is never held open for more than fifteen seconds, and in which a user must wait more than three minutes after calling the elevator.

Definition

Given an alphabet A, a timed word is a sequence, finite or infinite ${\displaystyle w=(a_{0},t_{0})(a_{1},t_{1})\dots }$  with ${\displaystyle a_{i}\in A}$ , ${\displaystyle t_{i}\in \mathbb {R} _{+}}$  with ${\displaystyle t_{i}\leq t_{i+1}}$  for each integer ${\displaystyle i}$ .

If the sequence is infinite but the sequence of ${\displaystyle (t_{0})(t_{1})\dots }$  is bounded, then this word is said to be a Zeno timed word,^[1] in reference to Zeno's paradoxes, where an infinite number of actions occur in a finite time.

The word ${\displaystyle \operatorname {untimed} (w)}$  is the word ${\displaystyle w}$  without its time stamps, i.e. it is ${\displaystyle a_{0}a_{1}\dots }$ . Given a timed language ${\displaystyle L}$ , ${\displaystyle \operatorname {untimed} (L)}$  is then the set of ${\displaystyle \operatorname {untimed} (w)}$  for ${\displaystyle w\in L}$ .

References

1. Estévenart, Morgane (September 2015). "2". Verifcation and synthesis of MITL through alternating timed automata (PhD). p. 56.

• Alur, Rajeev; Dill, David (1994). "A theory of timed automata". Theoretical Computer Science. 126 (2): 190. doi:10.1016/0304-3975(94)90010-8.