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
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressiveness of interaction
Theoretical Computer Science
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
More on bisimulations for higher order π-calculus
Theoretical Computer Science
| Hi-index | 0.00 |
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition. By exhibiting a nearly deterministic encoding of Minsky machines, the calculus is shown to be Turing complete and therefore its termination problem is undecidable. Strong bisimilarity, however, is shown to be decidable. Further, the main forms of strong bisimilarity for higher-order processes (higher-order bisimilarity, context bisimilarity, normal bisimilarity, barbed congruence) coincide. They also coincide with their asynchronous versions. A sound and complete axiomatization of bisimilarity is given. Finally, bisimilarity is shown to become undecidable if at least four static (i.e., top-level) restrictions are added to the calculus.