Revisiting Glue Expressiveness in Component-Based Systems - Coordination Models and Languages Access content directly
Conference Papers Year : 2011

Revisiting Glue Expressiveness in Component-Based Systems


We take a fresh look at the expressivity of BIP, a recent influential formal component model developed by J. Sifakis et al. We introduce a process calculus, called CAB, that models composite components as the combination of a glue (using BIP terminology) and subcomponents, and that constitutes a conservative extension of BIP with more dynamic forms of glues. We study the Turing completeness of CAB variants that differ only in their language for glues. We show that limiting the glue language to BIP glues suffices to obtain Turing-completeness, whereas removing priorities from the control language loses Turing-completeness. We also show that adding a simple form of dynamic component creation in the control language without priorities is enough to regain Turing completeness. These results complement those obtained on BIP, highlighting in particular the key role of priorities for expressivity.
Fichier principal
Vignette du fichier
978-3-642-21464-6_2_Chapter.pdf (423.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01582994 , version 1 (06-09-2017)





Cinzia Di Giusto, Jean-Bernard Stefani. Revisiting Glue Expressiveness in Component-Based Systems. 13th Conference on Coordination Models and Languages (COORDINATION), Jun 2011, Reykjavik, Iceland. pp.16-30, ⟨10.1007/978-3-642-21464-6_2⟩. ⟨hal-01582994⟩
359 View
153 Download



Gmail Facebook X LinkedIn More