Automata-Based CSL Model Checking

Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. The presented decision procedure, however, has exponential complexity. In this paper, we propose an effective approximation algorithm for full CSL. The key to our method is the notion of stratified CTMCs with respect to the CSL property to be checked. We present a measure-preservation theorem allowing us to reduce the problem to a transient analysis on stratified CTMCs. The corresponding probability can then be approximated in polynomial time (using uniformization). This makes the present work the centerpiece of a broadly applicable full CSL model checker. Recently, the decision algorithm by Aziz et al. was shown to be incorrect in general. In fact, it works only for stratified CTMCs. As an additional contribution, our measure-preservation theorem can be used to ensure the decidability for general CTMCs.
    Original languageEnglish
    Title of host publicationAutomata, Languages and Programming : 38th International Colloquium, ICALP 2011 - Zurich, Switzerland, July 4-8, 2011 - Proceedings, Part II
    Publication date2011
    ISBN (Print)978-3-642-22011-1
    ISBN (Electronic)978-3-642-22012-8
    Publication statusPublished - 2011
    Event38th International Colloquium on Automata, Languages and Programming - Zürich, Switzerland
    Duration: 4 Jul 20118 Jul 2011
    Conference number: 38


    Conference38th International Colloquium on Automata, Languages and Programming
    SeriesLecture Notes in Computer Science


    Dive into the research topics of 'Automata-Based CSL Model Checking'. Together they form a unique fingerprint.

    Cite this