Channel-based coordination via constraint satisfaction
Channel-based coordination via constraint satisfaction
复制标题
DOI：
10.1016/j.scico.2010.05.004
复制
发表时间：
2011-08
期刊：
影响因子：
--
通讯作者：
D. Clarke;J. Proença;A. Lazovik;F. Arbab
中科院分区：
文献类型：
--
作者：
D. Clarke;J. Proença;A. Lazovik;F. Arbab
Reo中的协调来自于成分连接符中的原语的行为约束的组合，例如通道。然而，由于通道隐喻的相互作用，这是一个固有的局部概念，以及合成施加的约束的非局部性质，理解和实施REO一直是具有挑战性的。在本文中，渠道隐喻退居次要地位。我们关注由原语组成所施加的行为约束，并将Reo的语义表述为约束满足问题。这不仅为REO连接器在同步和数据流约束方面的行为提供了清晰的描述，还为基于约束满足的新实现技术铺平了道路。我们还证明了这种方法比现有的基于连接符着色的技术更有效。
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.