On Density in Coordination Languages

Research output: Contribution in Book/Catalog/Report/Conference proceedingConference contribution


Coordination languages have been proved very suitable for modeling and programming service-oriented applications. In particular, those based on tuple spaces offer an elegant way of making different components of such applications interact smoothly through the deposit and retrieval of tuples in a shared space. However, in their basic form, these languages only allow one tuple to be put at a time and, when more than one tuple matches a required one, the selection is made non deterministically. This is obviously too weak to capture popularity or quality measures, which are nevertheless central in service oriented applications. To that end, we propose an extension of a Linda-like language aiming at promoting the notion of density and, based on De Boer and Palamidessi's notion of modular embedding, establish that it strictly increases the expressiveness of Linda. Following our previous work, we also study the hiearchy of the sublanguages induced by considering subsets of tuple primitives. © Springer-Verlag Berlin Heidelberg 2013.

Original languageEnglish
Title of host publicationAdvances in Service-Oriented and Cloud Computing
Subtitle of host publicationWorkshops of ESOCC 2013, Revised Selected Papers
EditorsCarlos Canal, Massimo Villari
PublisherSpringer Verlag
Number of pages15
Volume393 CCIS
ISBN (Print)978-3-642-45363-2
Publication statusPublished - 2013
EventEuropean Conference on Service-Oriented and Cloud Computing, ESOCC 2013 - Malaga, Spain
Duration: 11 Sept 201313 Sept 2013

Publication series

NameCommunications in Computer and Information Science
Volume393 CCIS
ISSN (Print)18650929


ConferenceEuropean Conference on Service-Oriented and Cloud Computing, ESOCC 2013


  • coordination languages
  • density
  • expressivity
  • service oriented applications


Dive into the research topics of 'On Density in Coordination Languages'. Together they form a unique fingerprint.

Cite this