Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic models. We show that these transformations preserve all properties expressible in a common semantics. This formal relation comprises the basis for a solid comparison and consolidation of the fundamental coordination concepts behind these two languages. Moreover, this basis offers translations that enable users of either language to benefit from the toolchains of the other.
Additional Metadata
Keywords Coordination, Concurrency, BIP, Reo, Automata, Formal Translation
ACM Distributed Systems (acm C.2.4)
MSC Distributed systems (msc 68M14)
THEME Software (theme 1)
Editor S. Knight , I. Lanese , A. Lluch Lafuente , H.T. Vieira
Persistent URL dx.doi.org/10.4204/EPTCS.189.3
Conference Interaction and Concurrency Experience
Citation
Dokter, K.P.C, Jongmans, S.-S.T.Q, Arbab, F, & Bliudze, S. (2015). Relating BIP and Reo. In S Knight, I Lanese, A Lluch Lafuente, & H.T Vieira (Eds.), . doi:10.4204/EPTCS.189.3