Model Checking Action- and State-Labelled Markov Chains

  • Authors:
  • Christel Baier;Lucia Cloth;Boudewijn Haverkort;Matthias Kuntz;Markus Siegle

  • Affiliations:
  • Universität Bonn;University of Twente;University of Twente;University of the Federal Armed Forces Munich;University of the Federal Armed Forces Munich

  • Venue:
  • DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce the logic asCSL, an extensionof continuous stochastic logic (CSL), which provides powerfulmeans to characterise execution paths of action- andstate-labelled Markov chains. In asCSL, path propertiesare characterised by regular expressions over actions andstate-formulas. Thus, the executability of a path not onlydepends on the available actions but also on the validityof certain state formulas in intermediate states. Our mainresult is that the model checking problem for asCSL canbe reduced to CSL model checking on a modified Markovchain, which is obtained through a product automaton construction.We provide a case study of a scalable cellularphone system which shows how the logic asCSL and themodel checking procedure can be applied in practice.