Chapter

Foundations of Software Science and Computation Structures

Volume 2030 of the series Lecture Notes in Computer Science pp 121-136

Date:

Temporary Data in Shared Dataspace Coordination Languages

  • Nadia BusiAffiliated withDipartimento di Scienze dell’Informazione, Università di Bologna
  • , Roberto GorrieriAffiliated withDipartimento di Scienze dell’Informazione, Università di Bologna
  • , Gianluigi ZavattaroAffiliated withDipartimento di Scienze dell’Informazione, Università di Bologna

Abstract

The shared dataspace metaphor is historically the most prominent representative of the family of coordination models. According to this approach, concurrent processes interact via the production, consumption, and test for presence/absence of data in a common repository. Recently, the problem of the accumulation of outdated and unwanted information in the shared repository has been addressed and it has been solved by introducing non-permanent data, obtained by associating an expiration time to data. In this paper we investigate the impact of the adoption of different notions of non-permanent data on the expressiveness of a Linda based process calculus.