Proving Positive Almost-Sure Termination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Proving Positive Almost-Sure Termination


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.

Dates and versions

inria-00000522 , version 1 (26-10-2005)



Olivier Bournez, Florent Garnier. Proving Positive Almost-Sure Termination. 16th International Conference on Rewriting Techniques and Applications - RTA'2005, Apr 2005, Nara/Japan, pp.323-337, ⟨10.1007/b135673⟩. ⟨inria-00000522⟩
70 View
0 Download



Gmail Facebook Twitter LinkedIn More