Temporary Data in Shared Dataspace Coordination Languages

Authors:
Nadia Busi;Roberto Gorrieri;Gianluigi Zavattaro
Affiliations:
-;-;-
Venue:
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Year:
2001

Citing 6
Cited 0

Computability of Recursive Functions

Journal of the ACM (JACM)
On the expressiveness of Linda coordination primitives

Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency

Communication and Concurrency
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
T spaces

IBM Systems Journal
Computation: finite and infinite machines

Computation: finite and infinite machines

Quantified Score

Hi-index	0.00

Visualization

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.