Comparative analysis of the expressiveness of shared dataspace coordination

DOI10.1016/S1571-0661(04)00322-6zbMath1268.68040MaRDI QIDQ2841273

Gianluigi Zavattaro, Antonio Brogi, Nadia Busi, Maurizio Gabbrielli

Publication date: 24 July 2013

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Distributed systems (68M14)

Uses Software

• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• Timed default concurrent constraint programming
• Embedding as a tool for language comparison
• On the expressiveness of Linda coordination primitives.
• A timed concurrent constraint language.
• On the expressiveness of coordination via shared dataspaces
• Generative communication in Linda
• Computability of Recursive Functions

This page was built for publication: Comparative analysis of the expressiveness of shared dataspace coordination