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.
Work partially supported by Italian Ministry of University - MURST 40% - Progetto TOSCA.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. Information and Computation, 156(1/2):90–121, 2000.
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.
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.
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.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
M.L. Minsky. Computation: finite and infinite machines. Prentice-Hall, 1967.
J.C. Shepherdson and J.E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217–255, 1963.
Sun Microsystem, Inc. JavaSpaces Specifications, 1998.
P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3), 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Gorrieri, R., Zavattaro, G. (2001). Temporary Data in Shared Dataspace Coordination Languages. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive