Relating BIP and reo

Kasper Dokter; Sung Shik Jongmans; Farhad Arbab; Simon Bliudze

doi:10.4204/EPTCS.189.3

Relating BIP and reo

Kasper Dokter
, Sung Shik Jongmans
, Farhad Arbab
, Simon Bliudze

Research output: Contribution to journal › Conference article › peer-review

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. 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.

Original language	English
Pages (from-to)	3-20
Number of pages	18
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	189
DOIs	https://doi.org/10.4204/EPTCS.189.3
Publication status	Published - 19 Aug 2015
Externally published	Yes
Event	8th Interaction and Concurrency Experience, ICE 2015 - Grenoble, France Duration: 4 Jun 2015 → 5 Jun 2015

Access to Document

10.4204/EPTCS.189.3

Cite this

@article{1939fae9e99441f1a8b9f30764e7deeb,

title = "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. 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.",

author = "Kasper Dokter and Jongmans, \{Sung Shik\} and Farhad Arbab and Simon Bliudze",

note = "Publisher Copyright: {\textcopyright} K. Dokter, S.-S. T. Q. Jongmans, F. Arbab \& S. Bliudze.; 8th Interaction and Concurrency Experience, ICE 2015 ; Conference date: 04-06-2015 Through 05-06-2015",

year = "2015",

month = aug,

day = "19",

doi = "10.4204/EPTCS.189.3",

language = "English",

volume = "189",

pages = "3--20",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

}

TY - JOUR

T1 - Relating BIP and reo

AU - Dokter, Kasper

AU - Jongmans, Sung Shik

AU - Arbab, Farhad

AU - Bliudze, Simon

N1 - Publisher Copyright: © K. Dokter, S.-S. T. Q. Jongmans, F. Arbab & S. Bliudze.

PY - 2015/8/19

Y1 - 2015/8/19

N2 - 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.

AB - 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.

U2 - 10.4204/EPTCS.189.3

DO - 10.4204/EPTCS.189.3

M3 - Conference article

AN - SCOPUS:84957618287

SN - 2075-2180

VL - 189

SP - 3

EP - 20

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 8th Interaction and Concurrency Experience, ICE 2015

Y2 - 4 June 2015 through 5 June 2015

ER -

Relating BIP and reo

Abstract

Access to Document

Fingerprint

Cite this