Concurrent models for Linda with transactions
Mathematical Structures in Computer Science
| Hi-index | 0.01 |
Linda is a coordination language which provides communication by means of primitives allowing the insertion, reading and withdrawal of elements to and from a shared data space. This communication mechanism is referred to as generative communication and it has been used in many other recent concurrent languages (e.g. Shared-Prolog, LO, Gamma). We first introduce a process calculus which embeds all the Linda coordination primitives, even the inp and readp operation which have not been considered by other papers on the semantics of Linda. Moreover, we introduce a truly concurrent semantics for Linda by providing our calculus with a net semantics based on contextual P/T nets. Such a kind of nets allows to model a high level of true concurrency because they embed the notion of "reading without consuming" on which the read operation of Linda is based. For example, in our approach the parallel-read (i.e. the simultaneous reading of the same message) is modeled.