Confluence and Convergence in Probabilistically Terminating Reduction Systems
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024A Distribution Semantics for Probabilistic Term Rewriting19 Oct 2024