Symmetry reduction for probabilistic model checking

Kwiatkowska, M., Norman, G. and Parker, D. (2006) Symmetry reduction for probabilistic model checking. Lecture Notes in Computer Science, 4144, pp. 234-248. (doi:10.1007/11817963_23)

Full text not currently available from Enlighten.

Abstract

We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stochastic characteristics. We target systems with a set of non-trivial, but interchangeable, components such as those which commonly arise in randomised distributed algorithms or probabilistic communication protocols. We show, for three types of probabilistic models, that symmetry reduction, similarly to the non-probabilistic case, allows verification to instead be performed on a bisimilar quotient model which may be up to factorially smaller. We then propose an efficient algorithm for the construction of the quotient model using a symbolic implementation based on multi-terminal binary decision diagrams (MTBDDs) and, using four large case studies, demonstrate that this approach offers not only a dramatic increase in the size of probabilistic model which can be quantitatively analysed but also a significant decrease in the corresponding run-times.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Kwiatkowska, M., Norman, G., and Parker, D.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
ISSN:0302-9743

University Staff: Request a correction | Enlighten Editors: Update this record