Proving Positive Almost-Sure Termination

Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. We focus here on the problem of termination of a set of probabilistic rewrite rules. A probabilistic rewrite system is said almost surely terminating if the probability that a derivation leads to a normal form is one. Such a system is said positively almost surely terminating if furthermore the mean length of a derivation is finite. We provide several results and techniques in order to prove positive almost sure termination of a given set of probabilistic rewrite rules. All these techniques subsume classical ones for non-probabilistic systems.

• Type: Conference
• Year: 2005
• Where: RTA
• Authors: Olivier Bournez, Florent Garnier
• Keywords: Probabilistic Rewrite, Probabilistic Rewrite Rules, Rewrite Rules, RTA 2005, Theoretical Computer Science