Decoupled execution of synchronous coordination models via behavioural automata

TL;DR

This paper presents behavioural automata, a new model for synchronous coordination systems that enables decoupled execution, improving scalability by distinguishing local and global actions in concurrent systems.

Contribution

It introduces behavioural automata based on Reo, allowing decoupled execution and explicit predicates for concurrent evolution, enhancing scalability of synchronous coordination models.

Findings

Encodes Reo and Linda models within behavioural automata

Introduces explicit predicates for concurrent evolution

Enables decoupled execution for scalable implementations

Abstract

Synchronous coordination systems allow the exchange of data by logically indivisible actions involving all coordinated entities. This paper introduces behavioural automata, a logically synchronous coordination model based on the Reo coordination language, which focuses on relevant aspects for the concurrent evolution of these systems. We show how our automata model encodes the Reo and Linda coordination models and how it introduces an explicit predicate that captures the concurrent evolution, distinguishing local from global actions, and lifting the need of most synchronous models to involve all entities at each coordination step, paving the way to more scalable implementations.