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.
Cite
@article{arxiv.1310.4571,
title = {Extended Connectors: Structuring Glue Operators in BIP},
author = {Eduard Baranov and Simon Bliudze},
journal= {arXiv preprint arXiv:1310.4571},
year = {2013}
}
Comments
In Proceedings ICE 2013, arXiv:1310.4019