On the Expressiveness and Decidability of Higher-Order Process Calculi

Ivan Lanese 1, 2 Jorge Perez 3 Davide Sangiorgi 1, 4 Alan Schmitt 5
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
5 CELTIQUE - Software certification with semantic analysis
IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Complete list of metadatas

Cited literature [50 references]  Display  Hide  Download

https://hal.inria.fr/hal-01112294
Contributor : Alan Schmitt <>
Submitted on : Monday, February 2, 2015 - 3:45:50 PM
Last modification on : Monday, September 9, 2019 - 11:24:02 AM
Long-term archiving on : Wednesday, May 27, 2015 - 3:43:14 PM

File

Lanese2011On-the-Expressivenes...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ivan Lanese, Jorge Perez, Davide Sangiorgi, Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. Journal of Information and Computation, Elsevier, 2011, 209 (2), pp.29. ⟨10.1016/j.ic.2010.10.001⟩. ⟨hal-01112294⟩

Share

Metrics

Record views

1997

Files downloads

201