Comparing three semantics for Linda-like languages

DOI10.1016/S0304-3975(99)00227-3zbMath0954.68092OpenAlexW2165981097MaRDI QIDQ1575148

Gianluigi Zavattaro, Nadia Busi, Roberto Gorrieri

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00227-3

zbMATH Keywords

behavioural equivalencescoordination languagessemantics of Lindaexpressiveness of concurrent languages

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (7)

Asynchronous Traces and Open Petri Nets ⋮ A process algebraic view of shared dataspace coordination ⋮ Concurrency cannot be observed, asynchronously ⋮ On asynchronous eventful session semantics ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ Comparing communication primitives via their relative expressive power ⋮ Nadia Busi's publications

Uses Software

• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• A process algebraic view of Linda coordination primitives
• On bisimulations for the asynchronous \(\pi\)-calculus
• On the expressiveness of Linda coordination primitives.
• Contextual nets
• Generative communication in Linda
• Barbed bisimulation
• Computability of Recursive Functions

This page was built for publication: Comparing three semantics for Linda-like languages