Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Coordination languages and their significance
Communications of the ACM
The algebra of timed processes, ATP: theory and application
Information and Computation
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
A Formalism for Remotely Interacting Processes
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
IBM Systems Journal
Computation: finite and infinite machines
Computation: finite and infinite machines
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
On the Expressiveness of Timed Coordination via Shared Dataspaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Data driven language for agents secure interaction
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
| Hi-index | 0.02 |
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. Typical garbage collection algorithms cannot be adopted in this context because there is no notion of unaccessible data. The most promising solution to this problem consists of the introduction of the notion of temporary data, intended as data with an associated expiration time. In this paper, we investigate the impact of different mechanisms for expired data collection on the expressiveness of shared dataspace coordination systems with temporary data.