robabilistic behavioural models are widely used to analyze secure,
embedded, networked, and also biological systems. The goal of this
research is to develop analysis techniques for very large or even
infinite size probabilistic models.For this, concise abstractions are
crucial, abstractions that are precise enough to obtain the desired
information and yet small enough to be efficiently analyzable. We show
how to find such abstractions for probabilistic systems in an iteractive
process in which a model that turns out to be too abstract is
automatically refined, based on a wheighted counterexample analysis. We
show that despite the fact that the scientific challenges faced are far
more intricate than in the non-probabilistic setting, it is possible to
come up with a sound and effective method, outperforming the thus far
leading approaches in this setting.