Confluence and Convergence in Probabilistically Terminating Reduction Systems

09/15/2017
by   Maja H. Kirkeby, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2018

A Preliminary Report on Probabilistic Attack Normal Form for Constellation Semantics

After Dung's founding work in Abstract Argumentation Frameworks there ha...
research
07/03/2023

On the Definition of the Eta-long Normal Form in Type Systems of the Cube

The smallest transitive relation < on well-typed normal terms such that ...
research
10/19/2020

On the Effectiveness of Fekete's Lemma

Fekete's lemma is a well known combinatorial result pertaining to number...
research
11/16/2017

Bounding the convergence time of local probabilistic evolution

Isoperimetric inequalities form a very intuitive yet powerful characteri...
research
09/04/2019

Gröbner Bases with Reduction Machines

In this paper, we make a contribution to the computation of Gröbner base...
research
10/19/2021

Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules

This paper studies a formalisation of intuitionistic logic by Negri and ...
research
10/23/2020

Intersection Types and (Positive) Almost-Sure Termination

Randomized higher-order computation can be seen as being captured by a l...

Please sign up or login with your details

Forgot password? Click here to reset