Comparative analysis of the expressiveness of shared dataspace coordination
From MaRDI portal
Recommendations
Cites work
- A timed concurrent constraint language.
- Complexity results for 1-safe nets
- Computability of Recursive Functions
- Embedding as a tool for language comparison
- Generative communication in Linda
- scientific article; zbMATH DE number 1629939 (Why is no real title available?)
- scientific article; zbMATH DE number 1705160 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1231687 (Why is no real title available?)
- On the expressiveness of coordination via shared dataspaces
- On the expressiveness of Linda coordination primitives.
- Timed default concurrent constraint programming
Cited in
(9)- Embedding as a tool for language comparison
- Comparing coordination models and architectures using embeddings
- On the expressiveness of coordination via shared dataspaces
- On the expressiveness of multiplicities in data-based coordination languages
- A process algebraic view of shared dataspace coordination
- scientific article; zbMATH DE number 1705160 (Why is no real title available?)
- scientific article; zbMATH DE number 1231687 (Why is no real title available?)
- Coordination Models and Languages
- On the expressiveness and efficiency of guarded lists in Bach
This page was built for publication: Comparative analysis of the expressiveness of shared dataspace coordination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841273)