An efficiency preorder for processes
Acta Informatica
Structured operational semantics and bisimulation as a congruence
Information and Computation
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
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
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the bisimulation proof method
Mathematical Structures in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
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
| Hi-index | 0.00 |
We consider the bisimulation proof method – an instance of the co-induction proof method – that is at the heart of the success of bisimulation. We discuss a number of enhancements of the method and some open problems.