%0 Conference Proceedings
%T Revisiting Glue Expressiveness in Component-Based Systems
%+ System architecture for reflective distributed computing environments (SARDES)
%A Giusto, Cinzia, Di
%A Stefani, Jean-Bernard
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th Conference on Coordination Models and Languages (COORDINATION)
%C Reykjavik, Iceland
%Y Wolfgang Meuter
%Y Gruia-Catalin Roman
%I Springer
%3 Coordination Models and Languages
%V LNCS-6721
%P 16-30
%8 2011-06-06
%D 2011
%R 10.1007/978-3-642-21464-6_2
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01582994/document
%2 https://inria.hal.science/hal-01582994/file/978-3-642-21464-6_2_Chapter.pdf
%L hal-01582994
%U https://inria.hal.science/hal-01582994
%~ UGA
%~ CNRS
%~ INRIA
%~ UNIV-GRENOBLE1
%~ UNIV-PMF_GRENOBLE
%~ INPG
%~ INRIA-RHA
%~ LIG
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-LNCS-6721
%~ INRIA-RENGRE
%~ LIG_SIDCH