An efficiency preorder for processes
Acta Informatica
Diagram techniques for confluence
Information and Computation
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
On the bisimulation proof method
Mathematical Structures in Computer Science
New up-to techniques for weak bisimulation
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
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, in the weak case they come as a collection of unrelated results, and lack a unified presentation. We propose a uniform and modular theory of up-to techniques for weak bisimulation that captures existing proof technology and introduces new techniques. Some proofs rely on non trivial – and new – commutation results based on termination guarantees.