Channel-based coordination via constraint satisfactionClarke, D., Proenca, J., Lazovik, A. & Arbab, F., 1-Aug-2011, In : Science of computer programming. 76, 8, p. 681-710 30 p.
Research output: Contribution to journal › Article › Academic › peer-review
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to the interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of the constraints imposed by composition. In this paper, the channel metaphor takes a back seat. We focus on the behavioural constraints imposed by the composition of primitives and phrase the semantics of Reo as a constraint satisfaction problem. Not only does this provide a clear description of the behaviour of Reo connectors in terms of synchronisation and data flow constraints, it also paves the way for new implementation techniques based on constraint satisfaction. We also demonstrate that this approach is more efficient than the existing techniques based on connector colouring. (C) 2010 Elsevier B.V. All rights reserved.
|Number of pages||30|
|Journal||Science of computer programming|
|Publication status||Published - 1-Aug-2011|
- Coordination, Constraint satisfaction, Constraint automata, Reo, Connector colouring, TIMED COMPONENT CONNECTORS, REO, AUTOMATA, SYSTEMS, MODEL