Interval abstraction plus big time steps semantics yields the first general effective model checker for stochastic automata with arbitrary distributions.
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
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
-
Effective Stochastic Automata Model Checking by Interval Abstraction (extended version)
Interval abstraction plus big time steps semantics yields the first general effective model checker for stochastic automata with arbitrary distributions.
-
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.