59 citations · 458 across the 94 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…
Modelling, Reduction and Analysis of Markov Automata (extended version)
Dennis Guck, Hassan Hatefi, Holger Hermanns +2
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic faul…
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…