Communications of the ACM
The concurrent language, Shared Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Coordination languages and their significance
Communications of the ACM
Concurrent constraint programming
Concurrent constraint programming
Programming by multiset transformation
Communications of the ACM
An overview of Manifold and its implementation
Concurrency: Practice and Experience
Embedding as a tool for language comparison
Information and Computation
Conference proceedings on PARLE'92
Distributed programming with logic tuple spaces
New Generation Computing
Why interaction is more powerful than algorithms
Communications of the ACM
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Comparing coordination models based on shared distributed replicated data
Proceedings of the 1999 ACM symposium on Applied computing
On the Expressive Power of Programming Languages
ESOP '90 Proceedings of the 3rd European Symposium on Programming
Embeddings Among Concurrent Programming Languages (Preliminary Version)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
Coordinating Services in Open Distributed Systems with LAURA
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Partial Order and SOS Semantics for Linear Constraint Programs
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Jada - Coordination and Communication for Java Agents
MOS '96 Selected Presentations and Invited Papers Second International Workshop on Mobile Object Systems - Towards the Programmable Internet
On the incomparability of Gamma and Linda
On the incomparability of Gamma and Linda
Bonita: A set of tuple space primitives for distributed coordination
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
A Principled Semantics for inp
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
The SPACETUB Models and Framework
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
A number of different coordination models for specifying inter-process communication and synchronisation rely on a notion of shared dataspace. Many of these models are extensions of the Linda coordination model, which includes operations for adding, deleting and testing the presence/absence of data in a shared dataspace. We compare the expressive power of three classes of coordination models based on shared dataspaces. The first class relies on Linda's communication primitives, while a second class relies on the more general notion of multi-set rewriting (e.g., like Bauhaus Linda or Gamma). Finally, we consider a third class of models featuring communication transactions that consist of sequences of Linda-like operations to be executed atomically (e.g., like in Shared Prolog or PoliS).