BIROn - Birkbeck Institutional Research Online

    Counterexamples in probabilistic model checking

    Han, Tingting and Katoen, J.-P. (2007) Counterexamples in probabilistic model checking. In: Grumberg, O. and Huth, M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems: 13th International Conference. Lecture Notes in Computer Science 4424. Springer, pp. 72-86. ISBN 9783540712084.

    Full text not available from this repository.

    Abstract

    This paper considers algorithms for counterexample generation for (bounded) probabilistic reachability properties in fully probabilistic systems. Finding the strongest evidence (i.e, the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that are mostly deviating from the required probability bound can be computed by adopting (partially new hop-constrained) k shortest paths algorithms that dynamically determine k.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 30 Mar 2021 13:11
    Last Modified: 30 Mar 2021 13:11
    URI: https://eprints.bbk.ac.uk/id/eprint/43753

    Statistics

    Downloads
    Activity Overview
    0Downloads
    25Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item