A moment-matching Erlang-mixture method approximates cumulative reward distributions in discrete-time Markov chains, enabling chance-constrained model checking on continuous reward spaces.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Robust Probabilistic Model Checking with Continuous Reward Domains
A moment-matching Erlang-mixture method approximates cumulative reward distributions in discrete-time Markov chains, enabling chance-constrained model checking on continuous reward spaces.