Date: 19 Apr 2002

Approximative Symbolic Model Checking of Continuous-Time Markov Chains

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al [1]. The considered logic contains a time-bounded until-operator and a novel operator to express steadystate probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded until and the steady state-operator) and a Volterra integral equation system for timebounded until. We propose a symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs. These new structures are suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.

The first and second author are sponsored by the DAAD-Project AZ 313-ARC-XII- 98/38 on stochastic modelling and verification.