39 citations · 92 across the 17 of their papers we have counts for
Showing 2013 · cs.SEShow all
2 papers · 2 filters
cs.SE2013
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…
cs.SE2013★ 13 cited
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…