Equations, Contractions, and Unique Solutions

Abstract

One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game. The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.

DOI: 10.1145/2971339

Extracted Key Phrases

Cite this paper

@article{Sangiorgi2015EquationsCA, title={Equations, Contractions, and Unique Solutions}, author={Davide Sangiorgi}, journal={ACM Trans. Comput. Log.}, year={2015}, volume={18}, pages={4:1-4:30} }