%0 Journal Article
%J Electronic Notes in Theoretical Computer Science
%D 2008
%T Coordination Models Orc and Reo Compared
%A José Proença
%A Dave Clarke
%I Elsevier
%N 4
%P 57–76
%R 10.1016/j.entcs.2008.03.099
%V 194
%X <p>Orcand Reo are two complementary approaches to the problem of coordinating components or services. On one hand, Orc is highly asynchronous, naturally dynamic, and based on ephemeral connections to services. On the other hand, Reo is based on the interplay between synchronization and mutual exclusion, is more static, and establishes more continuous connections between components (services). The question of how Orcand Reo relate to each other naturally arises. In this paper, we present a detailed comparison between the two models. We demonstrate that embedding non-recursive Orc expressions into Reo connectors is straightforward, whereas recursive Orc expressions require an extension to the Reo model. For the other direction, we argue that embedding Reo into Orc would require signicantly more eort. We conclude with some general observations and comparisons between the two approaches.</p>
%> https://haslab.uminho.pt/sites/default/files/joseproenca/files/orcandreocompared.pdf