probabilistic CTL
≈ 3 min read
Names in other languages
- Englishprobabilistic CTLprobabilistic computation tree logic
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) that allows for probabilistic quantification of described properties. It has been defined in the paper by Hansson and Jonsson. PCTL is a useful logic for stating soft deadline properties, e.g. "after a request for a service, there is at least a 98% probability that the service will be carried out within 2 seconds". Akin CTL suitability for model-checking PCTL extension is widely used as a property specification language for probabilistic model checkers.
Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) that allows for probabilistic quantification of described properties. It has been defined in the paper by Hansson and Jonsson. PCTL is a useful logic for stating soft deadline properties, e.g. "after a request for a service, there is at least a 98% probability that the service will be carried out within 2 seconds". Akin CTL suitability for model-checking PCTL extension is widely used as a property specification language for probabilistic model checkers. \phi ::= a \mid \neg \phi \mid \phi \lor \phi \mid \phi \land \phi \mid \mathcal{P}_{\sim\lambda}(\phi \mathcal{U} \phi) \mid \mathcal{P}_{\sim\lambda}(\square\phi) Therein, a \in A for some finite set A of atomic propositions, \sim \in \{ \} is a comparison operator and \lambda is a probability threshold. Formulas of PCTL are interpreted over discrete Markov chains. An interpretation structure is a quadruple K = \langle S, s^i, \mathcal{T}, L \rangle , where S is a finite set of states, s^i \in S is an initial state, \mathcal{T} is a transition probability function, \mathcal{T} : S \times S \to [0,1] , such that for all s \in S we have \sum_{s'\in S} \mathcal{T}(s,s')=1 , and L is a labeling function, L:S\to2^A , assigning atomic propositions to states. A path \sigma from a state s_0 is an infinite sequence of states s_0 \to s_1 \to \dots \to s_n \to \dots . The n-th state of the path is denoted as \sigma[n] and the prefix of \sigma of length n is denoted as \sigma\uparrow n . \mu_m(\{\sigma \in X : \sigma\uparrow n = s_0 \to \dots \to s_n \}) = \mathcal{T}(s_0,s_1) \times\dots\times\mathcal{T}(s_{n-1},s_n) For n = 0 the probability measure is equal to \mu_m(\{\sigma \in X : \sigma\uparrow 0 = s_0 \}) = 1 . s \models_K \mathcal{P}_{\sim\lambda}(f_1 \mathcal{U} f_2) if and only if \mu_m(\{\sigma : \sigma[0] = s \land (\exists i)\sigma[i] \models_K f_2 \land (\forall 0 \leq j , and s \models_K \mathcal{P}_{\sim\lambda}(\square f) if and only if \mu_m(\{\sigma : \sigma[0] = s \land (\forall i \geq 0)\sigma[i] \models_K f\}) \sim \lambda .
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1334423273 under CC BY-SA 4.0; modifications have been made.