Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints over a finite set of parameters. Important tasks in the analysis...
Saved in:
Published in | Information and computation Vol. 272; p. 104504 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.06.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!