Coordination Models Orc and Reo Compared

• Type: Article in International Scientific Journal
• Date: 2008

Authors

Proença, Jose (Author) Other; Clarke, Dave (Author) Other

Journal

Title: Electronic Notes in Theoretical Computer Science

Vol. 194

Pages: 57-76

ISSN: 1571-0661

Publisher: Elsevier

Indexing

Scopus - 7 Citations

Other information

Authenticus ID: P-00A-ADP

DOI: 10.1016/j.entcs.2008.03.099

Abstract (EN): Orc and 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 Orc and 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 significantly more effort. We conclude with some general observations and comparisons between the two approaches.

Language: English

Type (Professor's evaluation): Scientific