Tractable relational probabilistic hyperproperties for MDPs are identified with efficient algorithms for probability-equality queries on reachability and omega-regular events, plus hardness results and a fast implementation.
Parameter Synthesis for Markov Models: Faster Than Ever
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Introduces parametric Markov Automata and a two-step discretization approach to pMDPs that computes bounds on time-bounded reachability probabilities up to arbitrary precision.
citing papers explorer
-
Tractable Hyperproperties for MDPs
Tractable relational probabilistic hyperproperties for MDPs are identified with efficient algorithms for probability-equality queries on reachability and omega-regular events, plus hardness results and a fast implementation.
-
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.