On the Expressiveness and Decidability of Higher-Order Process Calculi - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2011

On the Expressiveness and Decidability of Higher-Order Process Calculi

Résumé

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.
Fichier principal
Vignette du fichier
Lanese2011On-the-Expressivenes.pdf (490.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01112294 , version 1 (02-02-2015)

Licence

Paternité

Identifiants

Citer

Ivan Lanese, Jorge A Perez, Davide Sangiorgi, Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. Information and Computation, 2011, 209 (2), pp.29. ⟨10.1016/j.ic.2010.10.001⟩. ⟨hal-01112294⟩
769 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More