A higher-order calculus of computational fields
From MaRDI portal
Publication:4617982
DOI10.1145/3285956zbMATH Open1407.68326arXiv1610.08116OpenAlexW2541133209MaRDI QIDQ4617982FDOQ4617982
Authors: Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Danilo Pianini, Jacob Beal 
Publication date: 7 February 2019
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Abstract: The complexity of large-scale distributed systems, particularly when deployed in physical space, calls for new mechanisms to address composability and reusability of collective adaptive behaviour. Computational fields have been proposed as an effective abstraction to fill the gap between the macro-level of such systems (specifying a system's collective behaviour) and the micro-level (individual devices' actions of computation and interaction to implement that collective specification), thereby providing a basis to better facilitate the engineering of collective APIs and complex systems at higher levels of abstraction. This paper proposes a full formal foundation for field computations, in terms of a core (higher-order) calculus of computational fields containing a few key syntactic constructs, and equipped with typing, denotational and operational semantics. Critically, this allows formal establishment of a link between the micro- and macro-levels of collective adaptive systems, by a result of full abstraction and adequacy for the (aggregate) denotational semantics with respect to the (per-device) operational semantics.
Full work available at URL: https://arxiv.org/abs/1610.08116
Recommendations
- From distributed coordination to field calculus and aggregate computing
- Type-based self-stabilisation for computational fields
- Asynchronous distributed execution of fixpoint-based computational fields
- A calculus for collective-adaptive systems and its behavioural theory
- Automatic moment-closure approximation of spatially distributed collective adaptive systems
adequacyfull abstractiontype soundnessspatial computingtype inference systemcomputational fieldcore calculusaggregate programming
Cites Work
- The Klaim project: Theory and practice
- Generative communication in Linda
- Title not available (Why is that?)
- Time-adaptive self stabilization
- Title not available (Why is that?)
- Mobile ambients
- Pure bigraphs: structure and dynamics
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Processes and the denotational semantics of concurrency
- Processes in space
- Order-sorted unification
- Title not available (Why is that?)
- A set of postulates for the foundation of logic
- Definability and full abstraction
- From distributed coordination to field calculus and aggregate computing
- Type-based self-stabilisation for computational fields
- A higher-order calculus of computational fields
- Agents and Peer-to-Peer Computing
- Title not available (Why is that?)
Cited In (12)
- Near-optimal knowledge-free resilient leader election
- Type-based self-stabilisation for computational fields
- Asynchronous distributed execution of fixpoint-based computational fields
- A higher-order calculus of computational fields
- AbU: a calculus for distributed event-driven programming with attribute-based interaction
- From distributed coordination to field calculus and aggregate computing
- Title not available (Why is that?)
- Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala
- Automatic moment-closure approximation of spatially distributed collective adaptive systems
- On a higher-order calculus of computational fields
- Objects, Agents, and Features
- A logical framework for reasoning about local and global properties of collective systems
Uses Software
This page was built for publication: A higher-order calculus of computational fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617982)
