1 citations · 1 across the 1 of their papers we have counts for
1 paper
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +2
We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking function…