Model checking expected time and expected reward formulae with random time bounds

Kwiatkowska, M., Norman, G. and Pacheco, A. (2006) Model checking expected time and expected reward formulae with random time bounds. Computers and Mathematics with Applications, 51(2), pp. 305-316. (doi: 10.1016/j.camwa.2005.11.016)

Full text not currently available from Enlighten.


In this paper, we extend CSL (continuous stochastic logic) with an expected time and an expected reward operator, both of which are parameterized by a random terminal time. With the help of such operators we can state, for example, that the expected sojourn time in a set of goal states within some generally distributed delay is at most (at least) some time threshold. In addition, certain performance measures of systems which contain general distributions can be calculated with the aid of this extended logic. We extend the efficient model checking of CTMCs against the logic CSL developed by Katoen et al. [1] to cater for the new operator. Our method involves precomputing a family of mixed Poisson expected sojourn time coefficients for a range of random variables which includes Pareto, uniform and gamma distributions, but otherwise carries the same computational cost as calculating CSL until formulae.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Kwiatkowska, M., Norman, G., and Pacheco, A.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Computers and Mathematics with Applications
ISSN (Online):1873-7668
Published Online:21 February 2006

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