Publications
Publications › References ›
2008
Technical reports
Game-Based Probabilistic Predicate Abstraction in PRISM
[KKNP08b]
M. Kattenbelt, M. Kwiatkowska, G. Norman and D. Parker.
Game-Based Probabilistic Predicate Abstraction in PRISM.
Technical report RR-08-01, Oxford University Computing Laboratory.
February 2008.
ps.gz pdf bib
- Downloads
PostScript 260 KB
PDF 358 KB
BibTeX
- Search for this paper
- Google · Google Scholar
Abstract
Modelling and verification of systems such as communication, network and security protocols,
which exhibit both probabilistic and non-deterministic behaviour, typically use Markov Decision Processes (MDPs).
For large, complex systems, abstraction techniques are essential.
This paper builds on a promising approach for abstraction of MDPs based on stochastic two-player games
which provides distinct lower and upper bounds for minimum and maximum probabilistic reachability properties.
Existing implementations work at the model level, limiting their scalability.
In this paper, we develop language-level abstraction techniques that build game-based abstractions of MDPs
directly from high-level descriptions in the PRISM modelling language, using predicate abstraction and SMT solvers.
For efficiency, we develop a compositional framework for abstraction.
We have applied our techniques to a range of case studies,
successfully verifying models larger than was possible with existing implementations.
We are also able to demonstrate the benefits of adopting a compositional approach.