Communication and concurrency
A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unique decomposition of processes
Theoretical Computer Science
The lazy Lambda calculus in a concurrency scenario
Information and Computation
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Proving congruence of bisimulation in functional programming languages
Information and Computation
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Bisimulation for higher-order process calculi
Information and Computation
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Computability of Recursive Functions
Journal of the ACM (JACM)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Decidability of Model Checking Mobile Ambients
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
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 Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
More on bisimulations for higher order π-calculus
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Extending howe's method to early bisimulations for typed mobile embedded resources with local names
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Steps on the road to component evolvability
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in 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 deterministic encoding of Minsky machines, the calculus is shown to be Turing complete. Therefore its termination problem is undecidable. Strong bisimilarity, however, is shown to be decidable. Furthermore, 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.