Probabilistic specifications with data types

where c is a condition, a an atomic action, f a real-valued expression yielding values in [0, 1], and ~t a vector of expressions. Based on μCRL (so data), with additional probabilistic choice Operational semantics defined in terms of probabilistic automata Minimal set of operators to facilitate formal manipulation Syntactic sugar easily definable Example: X = τ ∑ • n:N 1 2n : send(n) · X . This specification repeatedly chooses a natural number n with probability 1 2n, and then sends the number. 5. The linear format: LPPE