2013/10/17 by Eduard Baranov, Simon Bliudze
Computer Science · #cs.LO #cs.PL #cs.SE
paper · pdf · doi:10.4204/eptcs.131.3
published as EPTCS 131, 2013, pp. 20-35 · In Proceedings ICE 2013, arXiv:1310.4019
arxiv created 2013/10/17 · arxiv updated 2013/10/18
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.