Temporary Data in Shared Dataspace Coordination Languages

  • Nadia Busi
  • Roberto Gorrieri
  • Gianluigi Zavattaro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2030)


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.


  1. 1.
    N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. Information and Computation, 156(1/2):90–121, 2000.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    F.S. de Boer, M. Gabbrielli, and M.C. Meo. A Timed Linda Language. In Proc. of Coordination 2000, volume 1906 of Lecture Notes in Computer Science, pages 299–304. Springer-Verlag, Berlin, 2000.Google Scholar
  3. 3.
    C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proc. of ICALP’98, volume 1061 of Lecture Notes in Computer Science, pages 103–115. Springer-Verlag, Berlin, 1998.Google Scholar
  4. 4.
    J.M. Jacquet, K. De Bosschere, and A. Brogi. On Timed Coordination Languages. In Proc. of Coordination 2000, volume 1906 of Lecture Notes in Computer Science, pages 81–98. Springer-Verlag, Berlin, 2000.Google Scholar
  5. 5.
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  6. 6.
    M.L. Minsky. Computation: finite and infinite machines. Prentice-Hall, 1967.Google Scholar
  7. 7.
    J.C. Shepherdson and J.E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217–255, 1963.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Sun Microsystem, Inc. JavaSpaces Specifications, 1998.Google Scholar
  9. 9.
    P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3), 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nadia Busi
    • 1
  • Roberto Gorrieri
    • 1
  • Gianluigi Zavattaro
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations