Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Petri nets: an introduction
An overview of Manifold and its implementation
Concurrency: Practice and Experience
Transition system specifications with negative premises
Theoretical Computer Science
Complexity results for 1-safe nets
Theoretical Computer Science
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Computability of Recursive Functions
Journal of the ACM (JACM)
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Comparing three semantics for Linda-like languages
Theoretical Computer Science
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Shared tuple memories, shared memories, buses and lan's--linda implementations across the spectrum of connectivity
IBM Systems Journal
Computation: finite and infinite machines
Computation: finite and infinite machines
Process Calculi for Coordination: From Linda to JavaSpaces
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
GCCS: A Graphical Coordination Language for System Specification
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
State- and Event-Based Reactive Programming in Shared Dataspaces
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Tuple-Based Models in the Observation Framework
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Prioritized and parallel reactions in shared data space coordination languages
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
JavaSpaces and TSpaces are two coordination middlewares for distributed Java programming recently proposed by Sun and IBM, respectively. They are both inspired by the Linda coordination model: processes interact via the emission (out), consumption (in) and the test for absence (inp) of data inside a shared repository. The most interesting improvement introduced by these new products is the event notification mechanism (notify): a process can register interest in the incoming arrivals of a particular kind of data, and then receive communication of the occurrence of these events. We investigate the expressiveness of this new coordination mechanism and we prove that even if event notification strictly increases the expressiveness of a language with only input and output, the obtained language is still strictly less expressive than a language containing also the test for absence.