Introduces a graph-based pre-order construction to efficiently check sufficient conditions for monotonicity of reachability probabilities in parametric Markov chains.
Ze itschrift fr Wahrschein- lichkeitstheorie und Verwandte Gebiete 10 (1968)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Are Parametric Markov Chains Monotonic?
Introduces a graph-based pre-order construction to efficiently check sufficient conditions for monotonicity of reachability probabilities in parametric Markov chains.