Automatic vertification of real-time systems with discrete probability distributions

Marta Kwiatkowska, Gethin Norman, R Segala, Jeremy Sproston

Research output: Contribution to journalArticle

221 Citations (Scopus)


We consider the timed automata model of Alur and Dill (Theoret. Comput. Sci. 126 (1994) 183-235), which allows the analysis of real-time 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 this paper, we present a model for real-time systems augmented with discrete probability distributions. Furthermore, two approaches to model checking are introduced for this model. The first uses the algorithm of Baier and Kwiatkowska (Distributed Comput. 11 (1998) 125-155) to provide a verification technique against temporal logic formulae which can refer both to timing properties and probabilities. The second, generally more efficient, technique concerns the verification of probabilistic, real-time reachability properties. (C) 2002 Elsevier Science B.V. All rights reserved.
Original languageEnglish
Pages (from-to)101-150
Number of pages50
JournalTheoretical Computer Science
Issue number1
Publication statusPublished - 7 Jun 2002


Dive into the research topics of 'Automatic vertification of real-time systems with discrete probability distributions'. Together they form a unique fingerprint.

Cite this