Performability assessment by model checking of Markov reward models

Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen

    Research output: Contribution to journalArticleAcademicpeer-review

    23 Citations (Scopus)
    10 Downloads (Pure)


    This paper describes efficient procedures for model checking Markov reward models, that allow us to evaluate, among others, the performability of computer-communication systems. We present the logic CSRL (Continuous Stochastic Reward Logic) to specify performability measures. It provides flexibility in measure specification and paves the way for the numerical evaluation of a wide variety of performability measures. The formal measure specification in CSRL also often helps in reducing the size of the Markov reward models that need to be numerically analysed. The paper presents background on Markov-reward models, as well as on the logic CSRL (syntax and semantics), before presenting an important duality result between reward and time. We discuss CSRL model-checking algorithms, and present five numerical algorithms and their computational complexity for verifying time- and reward-bounded until-properties, one of the key operators in CSRL. The versatility of our approach is illustrated through a performability case study.
    Original languageEnglish
    Pages (from-to)1-36
    Number of pages36
    JournalFormal methods in system design
    Issue number1
    Publication statusPublished - 2010


    • Model checking
    • Performability
    • Markov reward models


    Dive into the research topics of 'Performability assessment by model checking of Markov reward models'. Together they form a unique fingerprint.

    Cite this