Architecture Modelling of Parametric Component-Based Systems

Abstract

We study formal modelling of architectures applied on parametric component-based systems consisting of an unknown number of instances of each component. Architecture modelling is achieved by means of logics. We introduce an extended propositional interaction logic and investigate its first-order level which serves as a formal language for the interactions of parametric systems. Our logic effectively describes the execution order of interactions which is a main feature in several important architectures. We state the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures.

Architectures in parametric component-based systems: Qualitative and quantitative modelling

“…A preliminary version of this paper appeared in [PR20b]. The present version extends the work of [PR20b] as follows:…”

“…Such architectures, with an increased interest in applications, are for instance the Request/Response and Publish/Subscribe. In [PR20b] we introduced a propositional logic that extends PIL by equipping it with two operators, namely the concatenation * and the shuffle operator ¡. With that logic we succeeded to represent architectures of component-based systems where the order of the interactions is involved.…”

“…The presented examples illustrate that EPIL formulas are expressive enough to encode the execution order of the permissible interactions as well as to specify the subsequent implementation of a component-based system's architecture through recursive interactions. We note that in [PR20b] we described Blackboard, Publish/Subscribe, and Request/Response architectures, without applying any iteration operator, and hence without allowing recursion in the corresponding interactions.…”

“…-We present extensive descriptions for the examples considered in [PR20b] and we provide several new examples of architectures modelled by FOEIL sentences. Moreover, we present the detailed proofs for the decidability results of FOEIL.…”