Communicating sequential processes
Communicating sequential processes
Parallel program design: a foundation
Parallel program design: a foundation
How to write parallel programs: a first course
How to write parallel programs: a first course
Coordination languages and their significance
Communications of the ACM
Solving the Linda multiple rd problem using the copy-collect primitive
Science of Computer Programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Concurrency: state models & Java programs
Concurrency: state models & Java programs
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Three Semantics of the Output Operation for Generative Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
On the Expressiveness of Coordination Models
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
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
The SPACETUB Models and Framework
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Garbage collection in LINDACAP
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Coordination with multicapabilities
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
The 'predicated' forms of the LINDA in and rd primitives have given problems for both kernel implementors and LINDA formalists. This paper firstly analyses these problems and then proposes a precise semantics for inp which is both reasonable, in that it does not admit unexpected or useless implementations, and implementable for open distributed tuple-space systems. The semantics is given in a CSP style by the introduction of several new operators including kick-start, and deadlock-breaking concurrency which together enable a variety of well-defined, and feasibly implementable interpretations. The paper includes a discussion of the implementation of these operators, and examples of the use of the resulting inp in practical coordination applications.