Reactivity properties on Markov chains decompose into almost-sure termination tasks with existing absorbing regions, enabling the first complete supermartingale certificates for almost-sure ω-regular properties and ε-complete ones for quantitative acceptance on countably infinite state spaces.
Principles of model checking , publisher =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
citing papers explorer
-
Complete $\omega$-Regular Supermartingale Certificates
Reactivity properties on Markov chains decompose into almost-sure termination tasks with existing absorbing regions, enabling the first complete supermartingale certificates for almost-sure ω-regular properties and ε-complete ones for quantitative acceptance on countably infinite state spaces.
-
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
- Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems