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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 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 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. a clock comparison x\sim c , with x\in X , c a number and \sim a comparison operator such as . a freeze quantification operator x.\phi , for \phi a TPTL formula with set of clocks X\cup\{x\} .

Furthermore, for I=(a,b) an interval, x\in I is considered as an abbreviation for x>a\land x ; and similarly for every other kind of intervals. The logic TPTL+Past is built as the future fragment of and also contains the temporal modal operator S. The next operator is not considered to be a part of syntax. It will instead be defined from other operators.

A closed formula is a formula over an empty set of clocks. Let \phi and \psi be two formulas over the set of clocks X , \xi a formula over the set of clocks X\cup\{y\} , x\in X , l\in\mathtt{AP} , c a number and \sim being a comparison operator such as : We first consider formulas whose main operator also belongs to LTL: \gamma,t,\nu\models l holds if l\in\gamma(t) , \gamma,t,\nu\models\neg\phi holds if \gamma,t,\nu\not\models\phi \gamma,t,\nu\models\phi\lor\psi holds if either \gamma,t,\nu\models\phi or \gamma,t,\nu\models\psi , or both \gamma,t,\nu\models\phi\mathbin\mathcal U\psi holds if there exists t such that t and \gamma,t,\nu\models\psi and for each t' with t ,   \gamma,t',\nu\models\phi , \gamma,t,\nu\models\phi\mathbin\mathcal S\psi holds if there exists t such that t and \gamma,t,\nu\models\psi and for each t' with t ,   \gamma,t',\nu\models\phi , \gamma,t,\nu\models x\sim c holds if t-\nu(y)\sim c , \gamma,t,\nu\models y.\xi holds if \gamma,t,\nu[y\to t]\models\phi holds.

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

Text derived from https://en.wikipedia.org/w/index.php?oldid=1315830236 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.