Programming distributed collective processes in the exchange calculus
From MaRDI portal
Cites work
- A hierarchy of temporal logics with past
- A one-pass tree-shaped tableau for LTL+past
- Asynchronous distributed execution of fixpoint-based computational fields
- Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala
- From distributed coordination to field calculus and aggregate computing
- scientific article; zbMATH DE number 2090911 (Why is no real title available?)
- Model checking spatial logics for closure spaces
- Petri nets, event structures and domains. I
- Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
- Specifying and Verifying Properties of Space
- The internet of things: a survey
- Time-fluid field-based coordination through programmable distributed schedulers
- Time, clocks, and the ordering of events in a distributed system
This page was built for publication: Programming distributed collective processes in the exchange calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858454)