“…Let AP be a fixed, finite set of atomic propositions. A (labelled) DTMC D is a tuple (S, P, L) where S is a finite set of states, P : S × S → [0, 1] is a probability matrix such that s ∈S P(s, s ) = 1 for all s ∈ S, and L : S → 2 AP is a labelling function which assigns to each state s ∈ S the set L(s) of atomic propositions that hold in s. A path through a DTMC is a sequence 1 The logic PCTL. Let a ∈ AP, probability p ∈ [0, 1], k ∈ N (or k = ∞) and be either ≤ or ≥.…”