An efficiency preorder for processes
Acta Informatica
Diagram techniques for confluence
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
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
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Up-to techniques for weak bisimulation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A correct abstract machine for safe ambients
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
(Bi)simulations up-to characterise process semantics
Information and Computation
| Hi-index | 5.23 |
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 bisimulation 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.