Extended Connectors: Structuring Glue Operators in BIP

Abstract

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.

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

“…We can now similarly extend the other algebras [15]. The interaction semantics of the causal interaction trees |·| :…”

“…In addition, this paper integrates our results published in the Proceedings of the 6th Interaction and Concurrency Experience workshop [15], where we transposed the theory of algebraic representations of BIP interaction models to the new semantics. In particular, these results allow the synthesis of connectors, encompassing both interaction and priority models, from Boolean formulas representing the state properties to be imposed by the glue operators.…”