Faster and symbolic CTMC model checking

Katoen, J.P., Kwiatkowska, M., Norman, G. and Parker, D. (2001) Faster and symbolic CTMC model checking. In: de Alfaro, L. and Gilmore, S. (eds.) Process Algebra and Probabilistic Methods : Performance Modeling and Verification : Joint International Workshop. Series: Lecture notes in computer science (2165). Springer-Verlag: Berlin; New York, pp. 23-38. ISBN 9783540425564 (doi: 10.1007/3-540-44804-7_2)

Abstract

This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (MTBDDs). Properties are expressed in Continuous Stochastic Logic (CSL) [7] which includes the means to express both transient and steady-state performance measures. We show that all CSL operators can be treated using standard operations on MTBDDs, thus allowing a rather straightforward implementation of symbolic CSL model checking on existing MTBDD-based platforms such as the verifier PRISM. The main result of the paper is an improvement of O(N) in the time complexity of checking time-bounded until-formulas, where N is the number of states in the CTMC under consideration. This result yields a drastic speed-up in the verification time of model checking CTMCs, both in the symbolic and non-symbolic case.

• Item Type: Book Sections
• Status: Published
• Glasgow Author(s) Enlighten ID: Norman, Dr Gethin
• Authors: Katoen, J.P., Kwiatkowska, M., Norman, G., and Parker, D.
• College/School: College of Science and Engineering > School of Computing Science
• Publisher: Springer-Verlag
• ISBN: 9783540425564