Timed word
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
Given an alphabet A, a timed word is a sequence, finite or infinite w=(a_0,t_0)(a_1,t_1)\dots with a_i\in A , t_i\in\mathbb R_+ with t_i\le t_{i+1} for each integer i . If the sequence is infinite but the sequence of (t_0)(t_1)\dots is bounded, then this word is said to be a Zeno timed word , in reference to Zeno's paradoxes, where an infinite number of actions occur in a finite time. The word \operatorname{untimed}(w) is the word w without its time stamps, i.e. it is a_0a_1\dots .
Given a timed language L , \operatorname{untimed}(L) is then the set of \operatorname{untimed}(w) for w\in L .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1259400182 under CC BY-SA 4.0; modifications have been made.