### Abstract

Language | English |
---|---|

Title of host publication | Logic-Based Program Synthesis and Transformation : 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers |

Editors | Fabio Fioravanti, John P. Gallagher |

Number of pages | 15 |

Place of Publication | Lecture Notes in Computer Science |

Publisher | Springer, LNCS |

Date | 10 Jul 2018 |

Pages | 164-179 |

ISBN (Print) | 978-3-319-94459-3 |

ISBN (Electronic) | 978-3-319-94460-9 |

DOIs | |

State | Published - 10 Jul 2018 |

Series | Lecture Notes in Computer Science |
---|---|

Volume | 10855 |

ISSN | 0302-9743 |

### Cite this

*Logic-Based Program Synthesis and Transformation: 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers*(pp. 164-179). Lecture Notes in Computer Science: Springer, LNCS. Lecture Notes in Computer Science, Vol.. 10855, DOI: 10.1007/978-3-319-94460-9_10

}

*Logic-Based Program Synthesis and Transformation: 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers.*Springer, LNCS, Lecture Notes in Computer Science, Lecture Notes in Computer Science, vol. 10855, pp. 164-179. DOI: 10.1007/978-3-319-94460-9_10

**Confluence and Convergence in Probabilistically Terminating Reduction Systems.** / Kirkeby, Maja Hanne; Christiansen, Henning.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Confluence and Convergence in Probabilistically Terminating Reduction Systems

AU - Kirkeby,Maja Hanne

AU - Christiansen,Henning

PY - 2018/7/10

Y1 - 2018/7/10

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-94460-9_10

DO - 10.1007/978-3-319-94460-9_10

M3 - Article in proceedings

SN - 978-3-319-94459-3

SP - 164

EP - 179

BT - Logic-Based Program Synthesis and Transformation

PB - Springer, LNCS

CY - Lecture Notes in Computer Science

ER -