## On the Expressiveness of Linda Coordination Primitives (0)

Venue: | Information and Computation |

Citations: | 22 - 11 self |

### BibTeX

@ARTICLE{Busi_onthe,

author = {Nadia Busi and Roberto Gorrieri and Gianluigi Zavattaro},

title = {On the Expressiveness of Linda Coordination Primitives},

journal = {Information and Computation},

year = {},

volume = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

We introduce a process algebra containing the coordination primitives of Linda (asynchronous communication via a shared data space, read operation, non-blocking test operators on the shared space). We compare two possible semantics for the output operation: the former, that we call ordered, defines the output as an operation that returns when the message has reached the shared data space; the latter, that we call unordered, returns just after sending the message to the tuple space. The process algebra under the ordered semantics is Turing powerful, as we are able to program any Random Access Machine. The main result of the paper is that the process algebra under the unordered semantics is not Turing powerful. This result is achieved by resorting to a net semantics in terms of contextual nets (P/T nets with inhibitor and read arcs), and showing that there exists a deadlock-preserving simulation of such nets by finite P/T nets, a formalism where termination is decidable. 1 Introduction ...

### Citations

3218 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...chronous bisimulation [ACS98] is the correct semantics for the instantaneous interpretation, while the correct semantics for the other two cases is a variant of the classic (synchronous) bisimulation =-=[Mil89]-=-, where inputs and outputs are treated symmetrically. In [BGZ97b] we also claimed the non Turing completeness of the unordered semantics; this result is strengthened (it holds also in presence of rd a... |

941 | Generative communication in Linda - Gelernter - 1985 |

458 |
L.: Computation: Finite and Infinite Machines
- Minsky
- 1967
(Show Context)
Citation Context ...t instruction requires a jump to an instruction number not appearing in the program. If the program terminates, the result of the computation is the contents of the registers specified as outputs. In =-=[Min67]-=- it is shown that the following two instructions are sufficient to model every recursive function: ffl Succ(r j ): adds 1 to the contents of register r j ; ffl DecJump(r j ; s): if the contents of reg... |

448 | Coordination Languages and their Significance - Gelernter, Carriero - 1992 |

361 | An object calculus for asynchronous communication - Honda, Tokoro - 1991 |

272 |
The Polyadic -Calculus: A Tutorial
- Milner
- 1993
(Show Context)
Citation Context ...value true is returned. We present a process algebra L containing the coordination primitives of Linda 1 , together with parallel composition and a limited form of recursion (the replication operator =-=[Mil91]-=-, Full version of [BGZ97d]. 1 We do not consider the eval operator of Linda because in our process algebraic approach it would simply correspond to a spawn operation. guarded on inputs). The primitive... |

221 | Barbed bisimulation
- Milner, Sangiorgi
- 1992
(Show Context)
Citation Context ...ctural equivalent to haijP (adopted in the asynchronous ��-calculus [HT91, Bou92]). The behavioural semantics for the three operational semantics was defined following the widely accepted approach=-= of [MS92]-=-. The main results of [BGZ97b] are that a variant of the asynchronous bisimulation [ACS98] is the correct semantics for the instantaneous interpretation, while the correct semantics for the other two ... |

205 | How to Write Parallel Programs: A Guide to the Perplexed - Carriero, Gelernter - 1989 |

142 |
How to write parallel programs: a first course
- Carriero, Gelernter
- 1990
(Show Context)
Citation Context .../T nets with inhibitor and read arcs), and showing that there exists a deadlock-preserving simulation of such nets by finite P/T nets, a formalism where termination is decidable. 1 Introduction Linda =-=[CG90]-=- is the most prominent representative of the family of coordination languages based on the principle of generative communication [Gel85, GC92]: a sender communicates with a receiver through a shared d... |

115 |
Transition system specifications with negative premises
- Groote
- 1993
(Show Context)
Citation Context ...rule (10) uses a negative premise; however, our operational semantics is well defined, because (as described by the following proposition) our transition system specification is strictly stratifiable =-=[Gro93]-=-, condition that ensures (as proved in [Gro93]) the existence of a unique transition system agreeing with it. Proposition 2.1 The transition system specification of Table 1 is strictly stratifiable. P... |

74 | The concurrent language Shared Prolog - Brogi, Ciancarini - 1991 |

65 |
On bisimulations for the asynchronous -calculus
- Amadio, Castellani, et al.
- 1996
(Show Context)
Citation Context ...ehavioural semantics for the three operational semantics was defined following the widely accepted approach of [MS92]. The main results of [BGZ97b] are that a variant of the asynchronous bisimulation =-=[ACS98]-=- is the correct semantics for the instantaneous interpretation, while the correct semantics for the other two cases is a variant of the classic (synchronous) bisimulation [Mil89], where inputs and out... |

57 |
Computability of recursive functions
- Shepherdson, Sturgis
- 1963
(Show Context)
Citation Context ...get a Turing powerful language, while this is not the case under the unordered semantics. Turing completeness of L o is proved by showing that it is possible to encode any Random Access Machine (RAM) =-=[SS63]-=-. On the contrary, the proof that L u is not Turing complete is rather elaborate and constitutes the main achievement of this paper. The proof consists in showing that the problem of termination is de... |

46 | Asynchrony and the -calculus - Boudol - 1992 |

45 | Implementation of Tuple Space Machines - Carriero - 1987 |

44 | Palsberg J.: Complexity results for 1-safe nets
- Cheng, Esparza
- 1993
(Show Context)
Citation Context ...stem is decidable; this can be proved by reducing it to the liveness problem, which is known to be decidable (see, e.g., [Reu88]). The theorem below is a slight generalization of the result proved in =-=[CEP95]-=- for nets where the preset and postset of transitions are sets. Theorem 4.3 Deadlock is reducible to liveness. Proof Let N = (S; T ; m 0 ) be a P/T system. We construct a net N 0 = (S 0 ; T 0 ; m 0 0 ... |

43 | A process algebraic view of Linda coordination primitives
- Busi, Gorrieri, et al.
- 1998
(Show Context)
Citation Context ...es not. The test on the tuple and the removal of the message are performed in one atomic step. The problem of defining a formal semantics for Linda has recently attracted some researchers (see, e.g., =-=[BGZ97c]-=- and the references therein for an overview). One interesting aspect is related to the semantics of the output operation out(a), for which there exist at least two natural interpretations, depending o... |

29 |
The mathematics of Petri nets
- Reutenauer
- 1990
(Show Context)
Citation Context ...et consists in deciding if it is live. The deadlock problem for a finite P/T system is decidable; this can be proved by reducing it to the liveness problem, which is known to be decidable (see, e.g., =-=[Reu88]-=-). The theorem below is a slight generalization of the result proved in [CEP95] for nets where the preset and postset of transitions are sets. Theorem 4.3 Deadlock is reducible to liveness. Proof Let ... |

22 | D.: On the operational semantics of a coordination language - Ciancarini, Jensen, et al. - 1995 |

19 | Linda implementation revisited - Douglas, Wood, et al. - 1995 |

15 | A Petri net semantics for -calculus - Busi, Gorrieri - 1995 |

13 |
G.: On the turing equivalence of linda coordination primitives
- Busi, Gorrieri, et al.
- 2000
(Show Context)
Citation Context ...e present a process algebra L containing the coordination primitives of Linda 1 , together with parallel composition and a limited form of recursion (the replication operator [Mil91], Full version of =-=[BGZ97d]-=-. 1 We do not consider the eval operator of Linda because in our process algebraic approach it would simply correspond to a spawn operation. guarded on inputs). The primitives in(a), out(a) and rd(a) ... |

10 | G.: Three semantics of the output operation for generative communication
- Busi, Gorrieri, et al.
- 1997
(Show Context)
Citation Context ...ws to program all the computable functions. But, for every possible encoding P of the function f with input i, the problem of termination of P is decidable. 5 Conclusion This paper comes in pair with =-=[BGZ97b]-=-, where we studied the operational and observational semantics of three different interpretations for the output operation for the subcalculus not containing rd and rdp. Besides the ordered and unorde... |

9 | An Informal Operational Semantics of C-Linda V2.3.5 - Narem - 1990 |

6 | Nets with Inhibitor and Read Arcs: Semantics, Analysis and Application to Process Calculi - Petri - 1998 |

5 | A Truly Concurrent view of Linda Interprocess Communication - Busi, Gorrieri, et al. - 1997 |

4 | A Causal Semantics for Contextual P/T nets - Busi, Pinna - 1995 |

1 | Semantics and Analysis of First-Class Tuple Spaces - Jagannathan - 1990 |