On a Higher-Order Calculus of Computational Fields - Formal Techniques for Distributed Objects, Components, and Systems
Conference Papers Year : 2019

On a Higher-Order Calculus of Computational Fields

Abstract

Computational fields have been proposed as an effective abstraction to fill the gap between the macro-level of distributed 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 approach is particularly suited to complex large-scale distributed systems, like the Internet-of-Things and Cyber-Physical Systems, where new mechanisms are needed to address composability and reusability of collective adaptive behaviour. This work introduces a full formal foundation for field computations, in terms of a core calculus equipped with typing, denotational, and operational semantics. Critically, we apply techniques for formal programming languages to collective adaptive systems: we provide formal establishment of a link between the micro- and macro-levels of collective adaptive systems, via a result of computational adequacy and abstraction for the (aggregate) denotational semantics with respect to the (per-device) operational semantics.
Fichier principal
Vignette du fichier
478668_1_En_17_Chapter.pdf (172.83 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02313736 , version 1 (11-10-2019)

Licence

Identifiers

Cite

Jacob Beal, Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Danilo Pianini. On a Higher-Order Calculus of Computational Fields. 39th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2019, Copenhagen, Denmark. pp.289-292, ⟨10.1007/978-3-030-21759-4_17⟩. ⟨hal-02313736⟩
59 View
32 Download

Altmetric

Share

More