Confluence and Convergence in Probabilistically Terminating Reduction Systems

Confluence and Convergence in Probabilistically Terminating Reduction Systems

thumbnail of paper_8

Maja H. Kirkeby and Henning Christansen, “Confluence and Convergence in Probabilistically Terminating Reduction Systems,” in LOPSTR 2017, LNCS vol. 10855.

abstract

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.

You must be logged in to post a comment.