%0 Journal Article
%T Accelerating Parametric Probabilistic Verification
%A Nils Jansen
%A Florian Corzilius
%A Matthias Volk
%A Ralf Wimmer
%A Erika ¨˘brah¨˘m
%A Joost-Pieter Katoen
%A Bernd Becker
%J Computer Science
%D 2013
%I arXiv
%X 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 of parameters. Our algorithm is based on two key ingredients: a graph decomposition into strongly connected subgraphs combined with a novel factorization strategy for polynomials. Experimental evaluations show that these approaches can lead to a speed-up of up to several orders of magnitude in comparison to existing approaches
%U http://arxiv.org/abs/1312.3979v3