A calculus of mobile processes, II
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
Bisimulations in the join-calculus
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A theory of weak bisimulation for Core CML
Journal of Functional Programming
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the Expressiveness and Decidability of Higher-Order Process Calculi
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A spatial logical characterisation of context bisimulation
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
More on bisimulations for higher order π-calculus
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Hi-index | 5.23 |
In this paper, we prove the coincidence between strong/weak context bisimulation and strong/weak normal bisimulation for higher order @p-calculus, which generalizes Sangiorgi's work. To achieve this aim, we introduce indexed higher order @p-calculus, which is similar to higher order @p-calculus except that every prefix of any process is assigned indices. Furthermore we present corresponding indexed bisimulations for this calculus, and prove the equivalence between these indexed bisimulations. Based on this result, we prove the main result of this paper, i.e., the equivalence between strong/weak context bisimulation and strong/weak normal bisimulation.