A Note on the Expressiveness of BIP

Eduard Baranov
(Ecole polytechnique fédérale de Lausanne)
Simon Bliudze
(Ecole polytechnique fédérale de Lausanne)

We extend our previous algebraic formalisation of the notion of component-based framework in order to formally define two forms–strong and weak–of the notion of full expressiveness. Our earlier result shows that the BIP (Behaviour-Interaction-Priority) framework does not possess the strong full expressiveness. In this paper, we show that BIP has the weak form of this notion and provide results detailing weak and strong full expressiveness for classical BIP and several modifications, obtained by relaxing the constraints imposed on priority models.

In Daniel Gebler and Kirstin Peters: Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics (EXPRESS/SOS 2016), Québec City, Canada, 22nd August 2016, Electronic Proceedings in Theoretical Computer Science 222, pp. 1–14.
Published: 9th August 2016.

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