Semantic models of a timed distributed dataspace architecture
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1705160 (Why is no real title available?)
- scientific article; zbMATH DE number 3890715 (Why is no real title available?)
- scientific article; zbMATH DE number 4011913 (Why is no real title available?)
- scientific article; zbMATH DE number 2182596 (Why is no real title available?)
- A fully abstract model for the exchange of information in multi-agent systems.
- Comparing coordination models and architectures using embeddings
- Concurrency verification. Introduction to compositional and noncompositional methods
- Distribution of a simple shared dataspace architecture
- Equivalent semantic models for a distributed dataspace architecture.
- Generative communication in Linda
- On the expressiveness of timed coordination models
- Proofs of Networks of Processes
- Tentative steps toward a development method for interfering programs
- Time, clocks, and the ordering of events in a distributed system
Cited in
(4)
This page was built for publication: Semantic models of a timed distributed dataspace architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770360)