A calculus of mobile processes, II
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
Normal Bisimulations in Calculi with Passivation
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Expressing first-order π-calculus in higher-order calculus of communicating systems
Journal of Computer Science and Technology
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
A logic for distributed higher order π-calculus
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Characterizing contextual equivalence in calculi with passivation
Information and Computation
More on bisimulations for higher order π-calculus
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we prove the coincidence between strong/weak context bisimulation and strong/weak normal bisimulation for higher order π-calculus, which generalizes Sangiorgi's work. To achieve this aim, we introduce indexed higher order π-calculus, which is similar to higher order π-calculus except that every prefix of any process is assigned to indices. Furthermore we present corresponding indexed bisimulations for this calculus, and prove the equivalence between these indexed bisimulations. As an application of this result, we prove the equivalence between strong/weak context bisimulation and strong/weak normal bisimulation.