On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

Résumé

Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-understood for first-order calculi but not in the higher-order setting: synchronous vs. asynchronous communication and polyadic vs. monadic communication. First, and similarly to the first-order setting, synchronous process-passing is shown to be encodable into asynchronous process- passing. Then, the absence of name-passing is shown to induce a hierarchy of higher-order process calculi based on the arity of polyadic communication, thus revealing a striking point of contrast with respect to first-order calculi. Finally, the passing of abstractions (i.e., functions from processes to processes) is shown to be more expressive than process-passing alone.
Fichier principal
Vignette du fichier
Lanese2010On-the-Expressivenes.pdf (163.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00514912 , version 1 (03-09-2010)

Identifiants

  • HAL Id : inria-00514912 , version 1

Citer

Ivan Lanese, Jorge A. Peréz, Davide Sangiorgi, Alan Schmitt. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Jul 2010, Bordeaux, France. pp.442--453. ⟨inria-00514912⟩
140 Consultations
143 Téléchargements

Partager

Gmail Facebook X LinkedIn More