Accelerating Parametric Probabilistic Verification


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… (More)
DOI: 10.1007/978-3-319-10696-0_31


3 Figures and Tables


Citations per Year

Citation Velocity: 23

Averaging 23 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics