Game-based probabilistic predicate abstraction in PRISM

Kattenbelt, M., Kwiatkowska, M., Norman, G. and Parker, D. (2008) Game-based probabilistic predicate abstraction in PRISM. Electronic Notes in Theoretical Computer Science, 220(3), pp. 5-21. (doi: 10.1016/j.entcs.2008.11.016)

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.

• Item Type: Articles
• Additional Information: Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008)
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Norman, Dr Gethin
• Authors: Kattenbelt, M., 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: Electronic Notes in Theoretical Computer Science
• Publisher: Elsevier Science
• ISSN: 1571-0661
• ISSN (Online): 1571-0661
• Published Online: 16 December 2008