Combine and conquer: Relating BIP and Reo
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. A formal relation between exogenous coordination languages comprises the basis for a solid comparison and consolidation of their fundamental concepts. 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. We use these transformations to define data-sensitive BIP architectures and their composition.
|Keywords||Coordination, Formal translations, Correctness proofs, BIP, Reo|
|Journal||Journal of Logical and Algebraic Methods in Programming|
Dokter, K.P.C, Jongmans, S.-S.T.Q, Arbab, F, & Bliudze, S. (2017). Combine and conquer: Relating BIP and Reo. Journal of Logical and Algebraic Methods in Programming, 86(1), 134–156. doi:10.1016/j.jlamp.2016.09.008