A higher-order calculus of computational fields
From MaRDI portal
Publication:4617982
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.
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
Cites work
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 194122 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 7269248 (Why is no real title available?)
- A higher-order calculus of computational fields
- A set of postulates for the foundation of logic
- Agents and Peer-to-Peer Computing
- Definability and full abstraction
- From distributed coordination to field calculus and aggregate computing
- Generative communication in Linda
- Mobile ambients
- Order-sorted unification
- 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
- Pure bigraphs: structure and dynamics
- The Klaim project: Theory and practice
- Time-adaptive self stabilization
- Type-based self-stabilisation for computational fields
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
- From distributed coordination to field calculus and aggregate computing
- AbU: a calculus for distributed event-driven programming with attribute-based interaction
- scientific article; zbMATH DE number 7269248 (Why is no real title available?)
- 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
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)
