A comparison of time- and reward-bounded probabilistic model checking techniques
From MaRDI portal
Recommendations
Cited in
(5)- Multi-cost bounded tradeoff analysis in MDP
- Quantitative controller synthesis for consumption Markov decision processes
- Identity-Based Cryptosystems and Quadratic Residuosity
- Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison
- A no-go theorem for coalgebraic product construction
This page was built for publication: A comparison of time- and reward-bounded probabilistic model checking techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660767)