Skip to Main content Skip to Navigation
Journal articles

New Up-To Techniques for Weak Bisimulation

Damien Pous 1, 2
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01442745
Contributor : Damien Pous Connect in order to contact the contributor
Submitted on : Friday, January 20, 2017 - 10:55:28 PM
Last modification on : Saturday, September 11, 2021 - 3:18:33 AM
Long-term archiving on: : Friday, April 21, 2017 - 4:52:26 PM

File

nuttwb.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Damien Pous. New Up-To Techniques for Weak Bisimulation. Theoretical Computer Science, Elsevier, 2007, 380, pp.164 - 180. ⟨10.1016/j.tcs.2007.02.060⟩. ⟨hal-01442745⟩

Share

Metrics

Record views

319

Files downloads

482