A moment-matching Erlang-mixture method approximates cumulative reward distributions in discrete-time Markov chains, enabling chance-constrained model checking on continuous reward spaces.
Probabilistic model checking and non-standard multi-objective reasoning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 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.