Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
The name discipline of uniform receptiveness
Theoretical Computer Science
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On Observing Dynamic Prioritised Actions in SOC
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
simpA: An agent-oriented approach for programming concurrent applications on top of Java
Science of Computer Programming
Behavioral theory for session-oriented calculi
Rigorous software engineering for service-oriented systems
On the bisimulation congruence in χ-calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
This paper presents some new results on barbed equivalences for the π-calculus. The equivalences studied are barbed congruence and a variant of it called open barbed bisimilarity. The difference between the two is that in open barbed the quantification over contexts is inside the definition of the bisimulation and is therefore recursive. It is shown that if infinite sums are admitted to the π-calculus then it is possible to give a simple proof that barbed congruence and early congruence coincide on all processes, not just on image-finite processes. It is also shown that on the π-calculus, and on the extension of it with infinite sums, open barbed bisimilarity does not correspond to any known labelled bisimilarity. It coincides with a variant of open bisimilarity in which names that have been extruded are treated in a special way, similarly to how names are treated in early bisimilarity.