New Up-To Techniques for Weak Bisimulation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2007

New Up-To Techniques for Weak Bisimulation

Résumé

Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for strong bisimilarity are well understood, the irregularities that appear in the weak case make it difficult to give a unified presentation. We propose a uniform and modular theory of up-to techniques for weak bisim-ulation that captures most of the existing proof technology and introduces new techniques. Some proofs rely on nontrivial – and new – commutation results based on termination guarantees. All results presented in this paper have been formally proved using the Coq proof assistant.
Fichier principal
Vignette du fichier
nuttwb.pdf (318.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01442745 , version 1 (20-01-2017)

Identifiants

Citer

Damien Pous. New Up-To Techniques for Weak Bisimulation. Theoretical Computer Science, 2007, 380, pp.164 - 180. ⟨10.1016/j.tcs.2007.02.060⟩. ⟨hal-01442745⟩
133 Consultations
95 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More