Citation Context

...cess, where data flow atomically through zero or more ports of the system. We use behavioural automata to give semantics to Reo, based on the constraint automata model [6], and to (distributed) Linda =-=[15]-=-. Each label of an automaton describes which ports should have dataflow, and what data should be flowing in each port. We write P to denote a global set of ports, L[P] to denote the set of all labels ...

Citation Context

...bles can be instantiated after selecting the transition. This suggests the use of a late-semantics for data-dependencies. Our approach to compose labels resembles Milner’s synchronous product in SCCS =-=[17]-=-, with the main difference that the product of behavioural automata do not require the all labels to be synchronised. The product of labels from two behavioural automata can be undefined, and labels c...

Citation Context

...10 Decoupled execution of synchronous coordination models 4 Encoding Linda Linda, introduced by Gelernter [15], is seen by many as the first coordination language. We describe it using Linda-calculus =-=[10]-=-, and show how it can be modelled using behavioural automata. Linda is based on the generative communication paradigm, which describes how different processes in a distributed environment exchange dat...

Citation Context

...re primitives with two ends. Existing tools for Reo include an editor, an animation generator, model checkers, editors of Reo-specific automata, QoS modelling and analysis tools, and a code generator =-=[5, 16]-=-. The behaviour of each primitive depends upon its current state.3 The semantics of a connector is described as a collection of possible steps for each state, and we call the change of state of the co...

Citation Context

...ination layer, where data flow atomically through a set of points of the coordinated system. The main motivation behind behavioural automata is to describe the synchronous semantics underlying Dreams =-=[18]-=-, a prototype distributed framework briefly discussed in §5.2 that stands out by the decoupled execution of Reo-like coordination models in a concurrent setting. Dreams improves the performance and sc...

Citation Context

... by incorporating the same ideas behind GALS in our approach to execute synchronisation models. More specifically, we introduce behavioural automata to model synchronous coordination, inspired in Reo =-=[6]-=-. Each step taken by an automata corresponds to a round of “synchronous” actions performed by the coordination layer, where data flow atomically through a set of points of the coordinated system. The ...

Citation Context

...ata from a single source. We now describe the composition of behavioural automata based on the operator ⊗ and on concurrency predicates. This composition mimics the composition of existing Reo models =-=[6, 11, 8]-=-. Definition 3 (Product of behavioural automata) The product of two behavioural automata b1 = 〈Q1, L[P1],→1,C1〉 and b2 = 〈Q2,L[P2],→2,C2〉, denoted by b1 ./ b2, is the behavioural automaton 〈Q1× Q2,L[P...

Citation Context

...ata from a single source. We now describe the composition of behavioural automata based on the operator ⊗ and on concurrency predicates. This composition mimics the composition of existing Reo models =-=[6, 11, 8]-=-. Definition 3 (Product of behavioural automata) The product of two behavioural automata b1 = 〈Q1, L[P1],→1,C1〉 and b2 = 〈Q2,L[P2],→2,C2〉, denoted by b1 ./ b2, is the behavioural automaton 〈Q1× Q2,L[P...

Citation Context

...tomaton. Furthermore, we allow the data values exchanged over the coordination layer to influence the choice of how components communicate with each other as well. We borrow ideas from the Tile model =-=[14, 4]-=-, distinguishing evolution in time (execution of the coordination system) and evolution in space (composition of coordination systems). Behavioural automata can be built by composing more primitive be...

Citation Context

...tomaton. Furthermore, we allow the data values exchanged over the coordination layer to influence the choice of how components communicate with each other as well. We borrow ideas from the Tile model =-=[14, 4]-=-, distinguishing evolution in time (execution of the coordination system) and evolution in space (composition of coordination systems). Behavioural automata can be built by composing more primitive be...

Citation Context

...re primitives with two ends. Existing tools for Reo include an editor, an animation generator, model checkers, editors of Reo-specific automata, QoS modelling and analysis tools, and a code generator =-=[5, 16]-=-. The behaviour of each primitive depends upon its current state.3 The semantics of a connector is described as a collection of possible steps for each state, and we call the change of state of the co...

Citation Context

...clear how to efficiently implement the high degrees of synchronisation expressed by Reo in a distributed context. To remedy this situation, the GALS (globally asynchronous, locally synchronous) model =-=[9, 13]-=- has been adopted, whereby local computation is synchronous and communication between different machines is asynchronous. Our work contributes to the field of coordination, in particular to the Reo co...

Citation Context

...clear how to efficiently implement the high degrees of synchronisation expressed by Reo in a distributed context. To remedy this situation, the GALS (globally asynchronous, locally synchronous) model =-=[9, 13]-=- has been adopted, whereby local computation is synchronous and communication between different machines is asynchronous. Our work contributes to the field of coordination, in particular to the Reo co...