Efficient CTMC Model Checking of Linear Real-Time Objectives

Benoit Barbot, T. Chen, Tingting Han, Joost P. Katoen, Alexandru Mereacre

    Research output: Contribution to conferencePaper

    31 Citations (Scopus)


    This paper makes verifying continuous-time Markov chains (CTMCs) against deterministic timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done by analyzing subgraphs of the product of CTMC C and the region graph of DTA A. This improves upon earlier results and allows to only use standard analysis algorithms. Our graph decomposition approach naturally enables bisimulation minimization as well as parallelization. Experiments with various examples confirm that these optimizations lead to significant speed-ups. We also report on experiments with multiple-clock DTA objectives. The objectives and the size of the problem instances that can be checked with our prototypical tool go (far) beyond what could be checked so far.
    Original languageUndefined
    Number of pages15
    Publication statusPublished - Mar 2011


    • IR-79389
    • EWI-21247

    Cite this