PRISM: Probabilistic Symbolic Model Checker

Abstract

In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports three probabilistic models: discrete-time Markov chains, continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL and CSL. The tool features three model checking engines: one symbolic, using BDDs (binary decision diagrams) and MTBDDs (multi-terminal BDDs); one based on sparse matrices; and one which combines both symbolic and sparse matrix methods. PRISM has been successfully used to analyse probabilistic termination, performance, dependability and quality of service properties for a range of systems, including randomized distributed algorithms [2], polling systems [22], workstation clusters [18] and wireless cell communication [17].

DOI: 10.1007/3-540-46029-2_13

Extracted Key Phrases

3 Figures and Tables

0204060'03'05'07'09'11'13'15'17
Citations per Year

677 Citations

Semantic Scholar estimates that this publication has 677 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Kwiatkowska2002PRISMPS, title={PRISM: Probabilistic Symbolic Model Checker}, author={Marta Z. Kwiatkowska and Gethin Norman and David Parker}, booktitle={Computer Performance Evaluation / TOOLS}, year={2002} }