Expressiveness of component-based frameworks: a study of the expressiveness of BIP

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 and study their properties. Our earlier result shows that the BIP (Behaviour–Interaction–Priority) framework does not p...

Full description

Saved in:
Bibliographic Details
Published in:Acta informatica 2020-12, Vol.57 (6), p.761-800
Main Authors: Baranov, Eduard, Bliudze, Simon
Format: Article
Language:English
Subjects:
Computer Science
Computer Systems Organization and Communication Networks
Constraint modelling
Data Structures and Information Theory
Information Systems and Communication Service
Logics and Meanings of Programs
Multiagent Systems
Original Article
Programming Languages
Semantics
Software Engineering
Software Engineering/Programming and Operating Systems
Theory of Computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 and study their properties. Our earlier result shows that the BIP (Behaviour–Interaction–Priority) framework does not possess the strong full expressiveness with respect to the sub-class of GSOS rules used for the definition of its semantics. In this paper, we refine this comparison detailing the expressiveness of classical BIP, Offer BIP and a number of variations obtained either by relaxing the constraints in the definition of priority models or by introducing positive premises into the rule formats used to define the operational semantics of composition operators. The obtained results are organised into an expressiveness hierarchy.
ISSN:0001-5903
1432-0525
DOI:10.1007/s00236-019-00337-7