Incremental Bisimulation Abstraction Refinement

Jens Christian Godskesen, Lei Song, Lijun Zhang

    Publikation: Artikel i tidsskrift og konference artikel i tidsskriftKonferenceartikelForskningpeer review

    Abstrakt

    Abstraction refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may- and must-quotient automata. These are induced by depth-bounded bisimulation equivalences of increasing depth. The approach is both sound and complete, since the equivalences converge to the genuine PCTL equivalence. Experimental results with a prototype implementation show the effectiveness of the approach.

    Konference

    Konference13th International Conference on Application of Concurrency to System Design
    Land/OmrådeSpanien
    ByBarcelona
    Periode08/07/201310/07/2013
    Internetadresse

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'Incremental Bisimulation Abstraction Refinement'. Sammen danner de et unikt fingeraftryk.

    Citationsformater