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.
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants , booktitle =
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
-
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.