Proving Positive Almost Sure Termination Under Strategies

DOI10.1007/11805618_27zbMath1151.68441OpenAlexW1503480448MaRDI QIDQ3527308

Florent Garnier, Olivier Bournez

Publication date: 25 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11805618_27

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes

Uses Software

• PRISM
• APMC

This page was built for publication: Proving Positive Almost Sure Termination Under Strategies