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.
| Original language | English |
|---|---|
| Pages (from-to) | 134-156 |
| Number of pages | 23 |
| Journal | Journal of Logical and Algebraic Methods in Programming |
| Volume | 86 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2017 |
| Externally published | Yes |
Keywords
- BIP
- Coordination
- Correctness proofs
- Formal translations
- Reo
Fingerprint
Dive into the research topics of 'Combine and conquer: Relating BIP and Reo'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver