Interval abstraction plus big time steps semantics yields the first general effective model checker for stochastic automata with arbitrary distributions.
In: Fischer, B., Uustalu, T
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.