Combine and conquer: Relating BIP and Reo

Abstract

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.

Communication Requirements for Team Automata

“…The latter would also concern an investigation of compatibility notions tailored to particular connectors as used, e.g., in BIP and Reo (cf. [29] for a comparison). Also the incorporation of asynchronous communication in synchronisation policies and the study of compatibility notions in this case [24,30] is a topic for future research.…”

Constraint automata with memory cells and their composition

“…For instance, we can translate Uml sequence/activity diagrams and Bpmn to constraint automata [45][46][47]. Algebras of Bliudze and Sifakis [19,20], originally developed for Bip [48], also have a straightforward interpretation in terms of constraint automata [49,50], thereby offering an interesting alternative possible syntax. Due to their generality, constraint automata can thus serve as an intermediate format for compiling specifications in many different languages and models of concurrency, by reusing the core of our compilers.…”