This paper describes how to employ multi-terminal binary decision diagrams (MTBDDs) for the construction and analysis of a general class of models that exhibit stochastic, probabilistic and non-deterministic behaviour. It is shown how the notorious problem of state space explosion can be circumvented by compositionally constructing symbolic (i.e. MTBDD-based) representations of complex systems from small-scale components. We emphasise, however, that compactness of the representation can only be achieved if heuristics are applied with insight into the structure of the system under investigation. We report on our experiences concerning compact representation, performance analysis and verification of performability properties.
- Markov Chain
- Binary Decision Diagrams
- Performability analysis
- Markov decision process
- Multi-terminal binary decision diagrams
- Model Checking
Hermanns, H., Kwiatkowska, M., Norman, G., Parker, D., & Siegle, M. (2003). On the use of MTBDDs for performability analysis and verification of stochastic systems. Journal of logic and algebraic programming, 56(1-2), 23-67. https://doi.org/10.1016/S1567-8326(02)00066-8