Introduces parametric Markov Automata and a two-step discretization approach to pMDPs that computes bounds on time-bounded reachability probabilities up to arbitrary precision.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
UMB is a new binary file format for probabilistic systems that provides a unified, efficient alternative to tool-specific textual representations.
citing papers explorer
-
Verification of Parametric Markov Automata under Time-bounded Reachability
Introduces parametric Markov Automata and a two-step discretization approach to pMDPs that computes bounds on time-bounded reachability probabilities up to arbitrary precision.
-
UMB: A Unified Markov Binary Format for Probabilistic Model Checking (extended version)
UMB is a new binary file format for probabilistic systems that provides a unified, efficient alternative to tool-specific textual representations.