Equations, Contractions, and Unique Solutions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2017

Equations, Contractions, and Unique Solutions


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 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 coinduc-tive 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 on CCS-like languages; an example dealing with higher-order languages is also shown.
Fichier principal
Vignette du fichier
main.pdf (384.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01647063 , version 1 (26-11-2017)



Davide Sangiorgi. Equations, Contractions, and Unique Solutions. ACM Transactions on Computational Logic, 2017, 18 (1), pp.1-36. ⟨10.1145/2971339⟩. ⟨hal-01647063⟩
50 View
445 Download



Gmail Facebook X LinkedIn More