Symbolic Model Checking of Probabilistic Processes using MTBDDs and the Kronecker Representation

This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized consensus algorithms and probabilistic failures. As a speci cation formalism we use the probabilistic branching-time temporal logic PBTL which allows one to express properties such as \under any scheduling of nondeterministic choices, the probability of holding until is true is at least 0.78/at most 0.04 ". We adapt the Kronecker representation of (Plateau 1985), which yields a very compact MTBDD encoding of the system