2011 | OriginalPaper | Buchkapitel
Hierarchical Counterexamples for Discrete-Time Markov Chains
verfasst von : Nils Jansen, Erika Ábrahám, Jens Katelaan, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker
Erschienen in: Automated Technology for Verification and Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper introduces a novel
counterexample generation
approach for the verification of discrete-time Markov chains (DTMCs) with two main advantages: (1) We generate
abstract
counterexamples which can be refined in a
hierarchical
manner. (2) We aim at minimizing the number of states involved in the counterexamples, and compute a
critical subsystem
of the DTMC whose paths form a counterexample. Experiments show that with our approach we can reduce the size of counterexamples and the number of computation steps by several orders of magnitude.