39 citations · 92 across the 17 of their papers we have counts for
3 papers · 1 filter
Accelerating Parametric Probabilistic Verification
Nils Jansen, Florian Corzilius, Matthias Volk +4
We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set…
High-level Counterexamples for Probabilistic Automata
Ralf Wimmer, Nils Jansen, Erika Ábrahám +1
Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic syst…
The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains
Nils Jansen, Erika Ábrahám, Maik Scheffler +5
This report presents the tool COMICS, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the…