Divergence and unique solution of equations

by   Adrien Durier, et al.

We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations) whose infinite unfolding never produces a divergence has the unique-solution property. We transport this result onto the operational setting of CCS and for bisimilarity. We then exploit the operational approach to: refine the theorem, distinguishing between different forms of divergence; derive an abstract formulation of the theorems, on generic LTSs; adapt the theorems to other equivalences such as trace equivalence, and to preorders such as trace inclusion. We compare the resulting techniques to enhancements of the bisimulation proof method (the `up-to techniques'). Finally, we study the theorems in name-passing calculi such as the asynchronous π-calculus, and use them to revisit the completeness part of the proof of full abstraction of Milner's encoding of the λ-calculus into the π-calculus for Lévy-Longo Trees.



There are no comments yet.


page 1

page 2

page 3

page 4


Eager Functions as Processes (long version)

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

Eager Functions as Processes

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

A categorical framework for congruence of applicative bisimilarity in higher-order languages

Applicative bisimilarity is a coinductive characterisation of observatio...

Formalized Lambek Calculus in Higher Order Logic (HOL4)

In this project, a rather complete proof-theoretical formalization of La...

The Benefit of Being Non-Lazy in Probabilistic λ-calculus

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...

A Formalization of Unique Solutions of Equations in Process Algebra

In this thesis, a comprehensive formalization of Milner's Calculus of Co...

Unique Solutions of Contractions, CCS, and their HOL Formalisation

The unique solution of contractions is a proof technique for bisimilarit...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.