Skip to Main content Skip to Navigation
Journal articles

On probabilistic term rewriting

Martin Avanzini 1 Ugo Dal Lago 2, 1 Akihisa Yamada 3 
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method—polynomial and matrix interpretations—are analyzed and shown to capture interesting and non trivial examples when automated. We capture probabilistic computation in a novel way by means of multidistribution reduction sequences, thus accounting for both the nondeterminism in the choice of the redex and the probabilism intrinsic in firing each rule.
Document type :
Journal articles
Complete list of metadata
Contributor : Martin Avanzini Connect in order to contact the contributor
Submitted on : Tuesday, November 26, 2019 - 7:18:59 PM
Last modification on : Friday, July 8, 2022 - 10:05:33 AM

Links full text




Martin Avanzini, Ugo Dal Lago, Akihisa Yamada. On probabilistic term rewriting. Science of Computer Programming, Elsevier, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩. ⟨hal-02381877⟩



Record views