Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2013 | QUANTITATIVE EVALUATION OF SYSTEMS, QEST 2014 | Journal |
Volume | ISSN | Citations |
8657 | 0302-9743 | 5 |
PageRank | References | Authors |
0.44 | 10 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nils Jansen | 1 | 284 | 27.77 |
| Florian Corzilius | 2 | 78 | 4.78 |
| Matthias Volk | 3 | 94 | 6.70 |
| Ralf Wimmer | 4 | 407 | 34.28 |
| Erika Ábrahám | 5 | 830 | 63.17 |
| Joost-Pieter Katoen | 6 | 4444 | 289.65 |
| Bernd Becker | 7 | 855 | 73.74 |