  While a mature body of work supports the study of rewriting systems, abstract
tools for Probabilistic Rewriting are still limited. In this paper we study the
question of uniqueness of the result (unique limit distribution), and develop a
set of proof techniques to analyze and compare reduction strategies. The goal
is to have tools to support the operational analysis of probabilistic calculi
(such as probabilistic lambda-calculi) where evaluation allows for different
reduction choices (hence different reduction paths).
