Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

01/03/2018

∙

We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of 0, action prefix, choice, and the recursion construct μ X._.

READ FULL TEXT

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

Divergence-Preserving Branching Bisimilarity

The aromatic bicomplex for the description of divergence-free aromatic forms and volume-preserving integrators

Further Results on Stability-Preserving Mechanisms for School Choice

Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example

Orhonormal wavelet bases on the 3D ball via volume preserving map from the regular octahedron

On Variants of Root Normalised Order-aware Divergence and a Divergence based on Kendall's Tau

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

Related Research

A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

Divergence-Preserving Branching Bisimilarity

The aromatic bicomplex for the description of divergence-free aromatic forms and volume-preserving integrators

Further Results on Stability-Preserving Mechanisms for School Choice

Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example

Orhonormal wavelet bases on the 3D ball via volume preserving map from the regular octahedron

On Variants of Root Normalised Order-aware Divergence and a Divergence based on Kendall's Tau