Programming interactions in collective adaptive systems by relying on attribute-based communication

Alrahman, Yehia Abd; Nicola, Rocco De; Loreti, Michele

doi:10.1016/j.scico.2020.102428

Cited by 37 publications

(25 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whenever a component finds a neighbour with a timestamp t higher than its own, it sets its own clock to t + 1. A similar approach can be taken to divide the computation into "rounds" and solve more complex problems, such as distributed graph coloring, see e.g., (Abd Alrahman et al, 2017). P qry ("direction", ?d, ?t ) @ ( pos − self.pos ≤ self.range ∧ time ≥ self.time) .…”

Section: Scelmentioning

confidence: 99%

Toward Formal Models and Languages for Verifiable Multi-Robot Systems

2018

Self Cite

View full text Add to dashboard Cite

Incorrect operations of a Multi-Robot System (MRS) may not only lead to unsatisfactory results, but can also cause economic losses and threats to safety. These threats may not always be apparent, since they may arise as unforeseen consequences of the interactions between elements of the system. This call for tools and techniques that can help in providing guarantees about MRSs behaviour. We think that, whenever possible, these guarantees should be backed up by formal proofs to complement traditional approaches based on testing and simulation.We believe that tailored linguistic support to specify MRSs is a major step towards this goal. In particular, reducing the gap between typical features of an MRS and the level of abstraction of the linguistic primitives would simplify both the specification of these systems and the verification of their properties. In this work, we review different agent-oriented languages and their features; we then consider a selection of case studies of interest and implement them useing the surveyed languages. We also evaluate and compare effectiveness of the proposed solution, considering, in particular, easiness of expressing non-trivial behaviour.

show abstract

Section: Scelmentioning

confidence: 99%

Toward Formal Models and Languages for Verifiable Multi-Robot Systems

2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…πcalculus [28] [31]. To mitigate the shortcomings of the current communication paradigms when dealing with CAS, we have proposed a kernel calculus, named AbC [3,9], to program CAS interactions. The idea is to permit the construction of formally verifiable CAS systems by relying on a minimal set of interaction primitives.…”

Section: Introductionmentioning

confidence: 99%

A distributed API for coordinating AbC programs

Alrahman

Garbi

2020

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Collective adaptive systems exhibit a particular notion of interaction where environmental conditions largely influence interactions. Previously, we proposed a calculus, named AbC, to model and reason about CAS. The calculus proved to be effective by naturally modelling essential CAS features. However, the question on the tradeoff between its expressiveness and its efficiency, when implemented to program CAS applications, is to be answered. In this article, we propose an efficient and distributed coordination infrastructure for AbC. We prove its correctness, and we evaluate its performance. The main novelty of our approach is that AbC components are infrastructure agnostic. Thus the code of a component does not specify how messages are routed in the infrastructure but rather what properties a target component must satisfy. We also developed a Go API, named GoAt, and an Eclipse plugin to program in a high-level syntax which can be automatically used to generate matching Go code. We showcase our development through a non-trivial case study.

show abstract

“…Moreover, we provide full proofs of all the results introduced there. The scope of this paper is focused on the theoretical aspects of our calculus while aspects concerning programming methodologies can be found in [9]; where we show how to program complex and challenging scenarios, featuring collaboration, adaptation and reconfiguration in an intuitive way.The rest of the paper is organised as follows. In Section 2 we formally present the syntax of AbC , while in Section 3 we introduce its operational semantics that is based on two relations, with the first one describing the behaviour of individual components and the second describing AbC system' behaviour.…”

mentioning

confidence: 99%

mentioning

confidence: 99%