From distributed coordination to field calculus and aggregate computing
From MaRDI portal
Publication:2011213
DOI10.1016/J.JLAMP.2019.100486zbMath1435.68049OpenAlexW2972522875MaRDI QIDQ2011213
Mirko Viroli, Ferruccio Damiani, Giorgio Audrito, Danilo Pianini, Jacob Beal, Roberto Casadei
Publication date: 28 November 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/715997
Related Items (4)
Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala ⋮ A Higher-Order Calculus of Computational Fields ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The small-gain theorem, the passivity theorem and their equivalence
- Integral quadratic constraint approach vs. multiplier approach
- A Lyapunov formulation of the nonlinear small-gain theorem for interconnected ISS systems
- Passivity-based control and estimation in networked robotics
- On the collective sort problem for distributed tuple spaces
- Type-based Self-stabilisation for Computational Fields
- The Byzantine Generals Problem
- Lyapunov stability theory of nonsmooth systems
- Consensus and Cooperation in Networked Multi-Agent Systems
- A Higher-Order Calculus of Computational Fields
- Generative communication in Linda
- Passivity as a Design Tool for Group Coordination
- Stabilisation of infinitesimally rigid formations of multi-robot networks
- Control of Minimally Persistent Leader-Remote-Follower and Coleader Formations in the Plane
- Foundations for Ensemble Modeling – The Helena Approach
- Engineering Self-Organising Systems
- From tuple spaces to tuple centres
This page was built for publication: From distributed coordination to field calculus and aggregate computing
