1 research outputs found
Confluence and Convergence in Probabilistically Terminating Reduction Systems
Convergence of an abstract reduction system (ARS) is the property that any
derivation from an initial state will end in the same final state, a.k.a.
normal form. We generalize this for probabilistic ARS as almost-sure
convergence, meaning that the normal form is reached with probability one, even
if diverging derivations may exist. We show and exemplify properties that can
be used for proving almost-sure convergence of probabilistic ARS, generalizing
known results from ARS.Comment: Pre-proceedings paper presented at the 27th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur,
Belgium, 10-12 October 2017 (arXiv:1708.07854