#### Filter Results:

- Full text PDF available (131)

#### Publication Year

1996

2017

- This year (4)
- Last 5 years (19)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata. These model systems exhibiting probabilistic, nondeterministic and real-time characteristics. In many application domains, all three aspects are essential; this includes, for example,… (More)

- Andrew Hinton, Marta Z. Kwiatkowska, Gethin Norman, David Parker
- TACAS
- 2006

Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour. PRISM is a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, from real-time communication protocols to biological signalling… (More)

- Marta Z. Kwiatkowska, Gethin Norman, David Parker
- Computer Performance Evaluation / TOOLS
- 2002

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… (More)

- Marta Z. Kwiatkowska, Gethin Norman, David Parker
- International Journal on Software Tools for…
- 2002

In this paper we present efficient symbolic techniques for probabilistic model checking. These have been implemented in PRISM, a tool for the analysis of probabilistic models such as discrete-time Markov chains, continuous-time Markov chains and Markov decision processes using specifications in the probabilistic temporal logics PCTL and CSL. Motivated by… (More)

- Marta Z. Kwiatkowska, Gethin Norman, David Parker
- QEST
- 2004

This paper gives a brief overview of version 2.0 of PRISM, a tool for the automatic formal verification of probabilistic systems, and some of the case studies to which it has already been applied.

We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-time system description express the model purely in terms of nondeterminism; however, it is often desirable to express the likelihood of the system making certain transitions. In… (More)

This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying DTMCs and CTMCs against specifications written in probabilistic extensions of temporal logic, including quantitative properties with rewards. Example properties include the probability… (More)

- Marta Z. Kwiatkowska, Gethin Norman, David Parker
- SIGMETRICS Performance Evaluation Review
- 2009

Probabilistic model checking is a formal verification technique for the modelling and analysis of stochastic systems. It has proved to be useful for studying a wide range of quantitative properties of models taken from many diffierent application domains. This includes, for example, performance and reliability properties of computer and communication… (More)

This tutorial provides an introduction to probabilistic model checking, a technique for automatically verifying quantitative properties of probabilistic systems. We focus on Markov decision processes (MDPs), which model both stochastic and nondeterministic behaviour. We describe methods to analyse a wide range of their properties, including specifications… (More)

- Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang
- Inf. Comput.
- 2004

Probabilistic timed automata are an extension of timed automata with discrete probability distributions, and can be used to model timed randomized protocols or fault-tolerant systems. We present symbolic model checking algorithms for probabilistic timed automata to verify qualitative properties, corresponding to satisfaction with probability 0 or 1, as well… (More)