Confluence and Convergence in Probabilistically Terminating Reduction Systems

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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.
Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation : 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers
EditorsFabio Fioravanti, John P. Gallagher
Number of pages15
PublisherSpringer
Publication date10 Jul 2018
Pages164-179
ISBN (Print)978-3-319-94459-3
ISBN (Electronic)978-3-319-94460-9
DOIs
Publication statusPublished - 10 Jul 2018
EventLOPSTR 2017 - International Symposium on Logic-Based Program Synthesis and Transformation - University of Namur, Namur, Belgium
Duration: 10 Oct 201712 Oct 2017
Conference number: 27
https://www.sci.unich.it/lopstr17/

Symposium

SymposiumLOPSTR 2017 - International Symposium on Logic-Based Program Synthesis and Transformation
Number27
LocationUniversity of Namur
CountryBelgium
CityNamur
Period10/10/201712/10/2017
Internet address
SeriesLecture Notes in Computer Science
Volume10855
ISSN0302-9743
SeriesTheoretical Computer Science and General Issues
Volume10855

Cite this

Kirkeby, M. H., & Christiansen, H. (2018). Confluence and Convergence in Probabilistically Terminating Reduction Systems. In F. Fioravanti, & J. P. Gallagher (Eds.), Logic-Based Program Synthesis and Transformation: 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers (pp. 164-179). Springer. Lecture Notes in Computer Science, Vol.. 10855, Theoretical Computer Science and General Issues, Vol.. 10855 https://doi.org/10.1007/978-3-319-94460-9_10