2 papers
cs.LO2026
Polynomial Invariants for Probabilistic Transition Systems with Unbounded Support
Anne Schreuder, Lorenz Winkler, Laura Kovács +1
We study the synthesis of polynomial invariants for probabilistic transition systems (PTS) based on martingale theory. We present tractable methods to verify that such polynomials…
cs.LO2025
Positive Almost-Sure Termination of Polynomial Random Walks
Lorenz Winkler, Laura Kovács
The number of steps until termination of a probabilistic program is a random variable. Probabilistic program termination therefore requires qualitative analysis via almost-sure ter…