On the Expressiveness of Joining

Thomas Given-Wilson 1 Axel Legay 1
1 ESTASYS - Efficient STAtistical methods in SYstems of systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : The expressiveness of communication primitives has been explored in a common framework based on the π-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality vs intensionality). Here another dimension coordination is considered that accounts for the number of processes required for an interaction to occur. Coordination generalises binary languages such as π-calculus to joining languages that combine inputs such as the Join Calculus and general rendezvous calculus. By means of possibility/impossibility of encodings, this paper shows coordination is unrelated to the other features. That is, joining languages are more expressive than binary languages, and no combination of the other features can encode a joining language into a binary language. Further, joining is not able to encode any of the other features unless they could be encoded otherwise.
Type de document :
Communication dans un congrès
8th Interaction and Concurrency Experience (ICE 2015), Jun 2015, Grenoble, France
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

Contributeur : Thomas Given-Wilson <>
Soumis le : dimanche 17 mai 2015 - 16:11:20
Dernière modification le : vendredi 16 novembre 2018 - 01:40:39
Document(s) archivé(s) le : mardi 15 septembre 2015 - 01:10:59


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01152456, version 1


Thomas Given-Wilson, Axel Legay. On the Expressiveness of Joining. 8th Interaction and Concurrency Experience (ICE 2015), Jun 2015, Grenoble, France. 〈hal-01152456〉



Consultations de la notice


Téléchargements de fichiers