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

Proving Positive Almost Sure Termination Under Strategies

Abstract

In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.

Dates and versions

inria-00102945 , version 1 (03-10-2006)

Identifiers

Cite

Bournez Olivier, Garnier Florent. Proving Positive Almost Sure Termination Under Strategies. 17th International Conference on Rewriting Techniques and Applications - RTA'2006, Aug 2006, Seattle, WA/USA, pp.357--371, ⟨10.1007/11805618⟩. ⟨inria-00102945⟩
30 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More