arXiv subjects

Maria Pittou

Publications and source records attributed to Maria Pittou.

3 recordsLinked to original sources

arXiv2022

A formal algebraic approach for the quantitative modeling of connectors in architectures

In this paper we propose an algebraic formalization of connectors in the quantitative setting, in order to address their non-functional features in architectures of component-based systems. We firstly present a weighted Algebra of Interactions over a set of ports and a commutative and idempotent semiring, which is proved sufficient for modeling well-known coordination schemes in the weighted setup. In turn, we study a weighted Algebra of Connectors over a set of ports and a commutative and idempotent semiring, which extends the weighted Algebra of Interactions with types that encode Rendezvous and Broadcast synchronization. We show the expressiveness of the algebra by modeling the weighted connectors of several coordination schemes. Moreover, we derive two subalgebras, namely the weighted Algebra of Synchrons and the weighted Algebra of Triggers, and study their properties. Finally, we introduce a concept of congruence relation for connectors in the weighted setup and we provide conditions for proving such a congruence.

cs.LO↗

arXiv2019

Modelling architectures of parametric weighted component-based systems

The design of complex software systems usually lies in multiple coordinating components with an unknown number of instances. For such systems a main challenge is modelling efficiently their architecture that determines the topology and the interaction principles among the components. To achieve well-founded design there is need to address the quantitative aspects of software architectures. In this paper we study the modelling problem of software architectures applied on parametric weighted component-based systems where the parameter is the number of instances of each component. For this, we introduce a weighted first-order extended interaction logic over a commutative semiring in order to serve as a modelling language for parametric quantitative architectures. We prove that the equivalence problem of formulas of that logic is decidable in the class (of subsemirings) of skew fields. Moreover, we show that our weighted logic can efficiently describe well-known parametric architectures with quantitative characteristics.

cs.LO↗

arXiv2019

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

One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address both the qualitative and non-functional aspects of architectures. In this paper we study the qualitative and quantitative formal modelling of architectures applied on parametric component-based systems, that consist of an unknown number of instances of each component. Specifically, 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 logics achieve to encode the execution order of interactions, which is a main feature in several important architectures, as well as to model recursive interactions. Moreover, we prove the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures. We show the robustness of our theory by effectively extending our results for parametric weighted architectures. For this, we study the weighted counterparts of our logics over a commutative semiring, and we apply them for modelling the quantitative aspects of concrete architectures. Finally, we prove that the equivalence problem of weighted first-order extended interaction logic formulas is decidable in a large class of semirings, namely the class (of subsemirings) of skew fields.

cs.LO↗