Automatic verification of real-time systems with discrete probability distributions

Kwiatkowska, M., Norman, G. , Segala, R. and Sproston, J. (2002) Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282(1), pp. 101-150. (doi: 10.1016/S0304-3975(01)00046-9)

Full text not currently available from Enlighten.

Publisher's URL:


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.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Kwiatkowska, M., Norman, G., Segala, R., and Sproston, J.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
Journal Abbr.:Theoret. comput. sci.
ISSN (Online):0304-3975
Published Online:31 May 2002

University Staff: Request a correction | Enlighten Editors: Update this record