Equations, Contractions, and Unique Solutions - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2017

Equations, Contractions, and Unique Solutions

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Davide Sangiorgi. Equations, Contractions, and Unique Solutions. ACM Transactions on Computational Logic, 2017, 18 (1), pp.1-36. ⟨10.1145/2971339⟩. ⟨hal-01647063⟩
52 Consultations
464 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More