On the Expressiveness and Decidability of Higher-Order Process Calculi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

On the Expressiveness and Decidability of Higher-Order Process Calculi

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 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.
Fichier principal
Vignette du fichier
Lanese2008On-the-Expressivenes.pdf (182.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00494584 , version 1 (23-06-2010)

Identifiers

Cite

Ivan Lanese, Jorge A. Peréz, Davide Sangiorgi, Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, Pennsylvania, United States. pp.145--155, ⟨10.1109/LICS.2008.8⟩. ⟨inria-00494584⟩
113 View
205 Download

Altmetric

Share

Gmail Facebook X LinkedIn More