Extended Connectors: Structuring Glue Operators in BIP

Eduard Baranov
(Ecole Polytechnique Fédérale de Lausanne, Switzerland)
Simon Bliudze
(Ecole Polytechnique Fédérale de Lausanne, Switzerland)

Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.

In Marco Carbone, Ivan Lanese, Alberto Lluch Lafuente and Ana Sokolova: Proceedings 6th Interaction and Concurrency Experience (ICE 2013), Florence, Italy, 6th June 2013, Electronic Proceedings in Theoretical Computer Science 131, pp. 20–35.
Published: 15th October 2013.

ArXived at: https://dx.doi.org/10.4204/EPTCS.131.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org