@article{BliSif08-acp-tc,
author = {Simon Bliudze and Joseph Sifakis},
title = {The Algebra of Connectors---Structuring Interaction in {BIP}},
journal = {{IEEE} Transactions on Computers},
volume = 57,
number = 10,
year = 2008,
issn = {0018-9340},
pages = {1315--1330},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.26},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

@InProceedings{BliSif07-acp-emsoft,
  author = 	 {Simon Bliudze and Joseph Sifakis},
  title = 	 {The Algebra of Connectors~---
                    {S}tructuring Interaction in {BIP}},
  crossref =	 {emsoft07},
  pages = {11--20},
  abstract = {We provide an algebraic formalisation of \emph{connectors} in
              {BIP}.  These are used to structure \emph{interactions} in a
              component-based system.  A connector relates a set of typed
              ports.  Types are used to describe different modes of
              synchronisation: rendezvous and broadcast, in particular.

              Connectors on a set of ports $P$ are modelled as terms of the
              algebra $AC(P)$, generated from $P$ by using an binary
              \emph{fusion} operator and a unary \emph{typing} operator.
              Typing associates with terms (ports or connectors)
              synchronisation types -- \emph{trigger} or \emph{synchron} --
              that determine modes of synchronisation.  Broadcast
              interactions are initiated by triggers.  Rendezvous is a
              maximal interaction of a connector including only synchrons.

              The semantics of $AC(P)$ associates with a connector the set
              of its interactions.  It induces on connectors an equivalence
              relation which is not a congruence as it is not stable for
              fusion. We provide a number of properties of $AC(P)$ used to
              symbolically simplify and handle connectors.  We provide
              examples illustrating applications of $AC(P)$, including a
              general component model encompassing synchrony, methods for
              incremental model decomposition, and efficient implementation
              by using symbolic techniques.}
}

@Proceedings{emsoft07,
  title = 	 {Proceedings of the 7th {ACM \& IEEE} International Conference
                    on Embedded Software, {EMSOFT} 2007, October 1--3, 2007,
                    Salzburg, Austria},
  year = 	 2007,
  booktitle =	 {Proceedings of the {EMSOFT'07}},
  address =	 {Salzburg, Austria},
  month =	 oct,
  organization = {ACM SigBED}
}

@TechReport{BliSif07-acp-tr,
  author =   {Simon Bliudze and Joseph Sifakis},
  title =    {The Algebra of Connectors~--- Structuring Interaction in {BIP}},
  institution = {VERIMAG},
  year =     2007,
  number =   {TR-2007-3},
  abstract = {We provide an algebraic formalisation of \emph{connectors} in
              BIP.  These are used to structure \emph{interactions} in a
              component-based system.  A connector relates a set of typed
              ports.  Types are used to describe different modes of
              synchronisation: rendezvous and broadcast, in particular.

              Connectors on a set of ports $P$ are modelled as terms of the
              algebra $AC(P)$, generated from $P$ by using an binary
              \emph{fusion} operator and a unary \emph{typing} operator.
              Typing associates with terms (ports or connectors)
              synchronisation types -- \emph{trigger} or \emph{synchron} --
              that determine modes of synchronisation.  Broadcast
              interactions are initiated by triggers.  Rendezvous is a
              maximal interaction of a connector including only synchrons.

              The semantics of $AC(P)$ associates with a connector the set
              of its interactions.  It induces on connectors an equivalence
              relation which is not a congruence as it is not stable for
              fusion. We provide a number of properties of $AC(P)$ used to
              symbolically simplify and handle connectors.  We provide
              examples illustrating applications of $AC(P)$, including a
              general component model encompassing synchrony, methods for
              incremental model decomposition, and efficient implementation
              by using symbolic techniques.},
  note = {\\\texttt{http://www-verimag.imag.fr/index.php?page=techrep-list}}
}