Abstract
| Original 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 |
| Publisher | Springer |
| Publication date | 10 Jul 2018 |
| Pages | 164-179 |
| ISBN (Print) | 978-3-319-94459-3 |
| ISBN (Electronic) | 978-3-319-94460-9 |
| DOIs | |
| Publication status | Published - 10 Jul 2018 |
| Event | LOPSTR 2017 - International Symposium on Logic-Based Program Synthesis and Transformation - University of Namur, Namur, Belgium Duration: 10 Oct 2017 → 12 Oct 2017 Conference number: 27 https://www.sci.unich.it/lopstr17/ |
Symposium
| Symposium | LOPSTR 2017 - International Symposium on Logic-Based Program Synthesis and Transformation |
|---|---|
| Number | 27 |
| Location | University of Namur |
| Country | Belgium |
| City | Namur |
| Period | 10/10/2017 → 12/10/2017 |
| Internet address |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 10855 |
| ISSN | 0302-9743 |
| Series | Theoretical Computer Science and General Issues |
|---|---|
| Volume | 10855 |
Cite this
}
Confluence and Convergence in Probabilistically Terminating Reduction Systems. / Kirkeby, Maja Hanne; Christiansen, Henning.
Logic-Based Program Synthesis and Transformation: 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers. ed. / Fabio Fioravanti; John P. Gallagher. Springer, 2018. p. 164-179 (Lecture Notes in Computer Science, Vol. 10855). (Theoretical Computer Science and General Issues, Vol. 10855).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
A2 - Fioravanti, Fabio
A2 - Gallagher, John P.
PB - Springer
ER -