On the Expressiveness of Joining - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

On the Expressiveness of Joining

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

Dates and versions

hal-01152456 , version 1 (17-05-2015)

Identifiers

  • HAL Id : hal-01152456 , version 1

Cite

Thomas Given-Wilson, Axel Legay. On the Expressiveness of Joining. 8th Interaction and Concurrency Experience (ICE 2015), Jun 2015, Grenoble, France. ⟨hal-01152456⟩
414 View
66 Download

Share

Gmail Facebook X LinkedIn More