On the expressiveness of Linda coordination primitives.
From MaRDI portal
Publication:1854324
DOI10.1006/inco.1999.2823zbMath1046.68616OpenAlexW2040821818MaRDI QIDQ1854324
Roberto Gorrieri, Nadia Busi, Gianluigi Zavattaro
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/677c32787b098dcb0e452cc5286ec84105b58294
Related Items (17)
Expired data collection in shared dataspaces. ⋮ Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ On the Expressiveness of Symmetric Communication ⋮ When to Move to Transfer Nets ⋮ Observational and behavioural equivalences for soft concurrent constraint programming ⋮ Expressiveness of concurrent intensionality ⋮ On the Introduction of Guarded Lists in Bach: Expressiveness, Correctness, and Efficiency Issues ⋮ Breaking symmetries ⋮ Termination detection for active objects ⋮ A process algebraic view of shared dataspace coordination ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ Comparing communication primitives via their relative expressive power ⋮ Nadia Busi's publications ⋮ Comparative analysis of the expressiveness of shared dataspace coordination ⋮ Comparing three semantics for Linda-like languages ⋮ Quantitative information in the tuple space coordination model ⋮ Analysis issues in Petri nets with inhibitor arcs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for 1-safe nets
- Transition system specifications with negative premises
- A process algebraic view of Linda coordination primitives
- On bisimulations for the asynchronous \(\pi\)-calculus
- Contextual nets
- Generative communication in Linda
- Barbed bisimulation
- Computability of Recursive Functions
This page was built for publication: On the expressiveness of Linda coordination primitives.