A Notion of Glue Expressiveness for Component-Based Systems

  • Simon Bliudze
  • Joseph Sifakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5201)


Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g. automaton and Turing machine. This leads to a notion of expressiveness which is not adequate for component-based systems where separation between behavior and coordination mechanisms is essential. The paper proposes a notion of glue expressiveness for component-based frameworks characterizing their ability to coordinate components.

Glue is a closed under composition set of operators mapping tuples of behavior into behavior. Glue operators preserve behavioral equivalence. They only restrict the behavior of their arguments by performing memoryless coordination.

Behavioral equivalence induces an equivalence on glue operators. We compare expressiveness of two glues G 1 and G 2 by considering whether glue operators of G 1 have equivalent ones in G 2 (strong expressiveness). Weak expressiveness is defined by allowing a finite number of additional behaviors in the arguments of operators of G 2.

We propose an SOS-style definition of glues, where operators are characterized as sets of SOS-rules specifying the transition relation of composite components from the transition relations of their constituents. We provide expressiveness results for the glues of BIP and of process algebras such as CCS, CSP and SCCS. We show that for the considered expressiveness criteria, glues of the considered process calculi are less expressive than general SOS glue. Furthermore, glue of BIP has exactly the same strong expressiveness as glue definable by the SOS characterization.


Parallel Composition Label Transition System Process Algebra Derivation Rule Process Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Felleisen, M.: On the expressive power of programming languages. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol. 432, pp. 134–151. Springer, Heidelberg (1990)Google Scholar
  2. 2.
    Sifakis, J.: A framework for component-based construction. In: 3rd IEEE Int. Conf. on Software Engineering and Formal Methods (SEFM 2005), September 2005, pp. 293–300 (2005) (Keynote talk)Google Scholar
  3. 3.
    Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: 4th IEEE Int. Conf. on Software Engineering and Formal Methods (SEFM 2006), September 2006, pp. 3–12 (2006) (Invited talk)Google Scholar
  4. 4.
    Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19. University of Aarhus (1981)Google Scholar
  5. 5.
    Bloom, B.: Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, Massachusetts Institute of Technology (1989)Google Scholar
  6. 6.
    Aceto, L., Fokkink, W., Verhoef, C.: Structural Operational Semantics. In: Handbook of Process Algebra, ch.3, pp. 197–292. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  7. 7.
    Mousavi, M., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theoretical Computer Science 373(3), 238–272 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  9. 9.
    Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  10. 10.
    Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science 25(3), 267–310 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Bliudze, S., Sifakis, J.: The algebra of connectors — Structuring interaction in BIP. In: Proc. of the EMSOFT 2007, October 2007, pp. 11–20. ACM SigBED (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Simon Bliudze
    • 1
  • Joseph Sifakis
    • 1
  1. 1.VERIMAG, Centre ÉquationGièresFrance

Personalised recommendations