Back to search

Aristotle University Of Thessaloniki (AUTH)

Quantitative architecture styles

Abstract

dc:description

Software architectures are crucial in design and development of complex software systems. In order for the systems to work satisfying their properties they must be based on a proper software architecture. Software architectures have both qualitative and quantitative features. Qualitative features mainly concern the way the components in the architecture interact, whereas the quantitative features are for instance the implementation cost or also the degree of uncertainty of the interactions. Most work has been based on characterizing only the qualitative features of software architectures. However, a software architecture is considered to be more representative of a system, if it is able to characterize both qualitative and quantitative features. Yet another basic requirements for software architectures to describe efficiently software systems are to be correct-by-construction and helpful to stakeholders in understanding and analyzing the way the components interact. In this dissertation, we address these issues and more by studying weighted logics which are able to describe software architectures with quantitative features. Mathematical logics are a very useful tool for formally describing software architectures by ensuring correctness-by-construction. We propose three weighted logics where they can describe a range of quantitative features of architectures. For our logics, we consider that every interaction in an architecture has a weight. This weight can either represent the cost, the probability, the uncertainty, or the time needed of the implementation of the interaction. Firstly, we introduce and investigate a weighted propositional configuration logic over a commutative semiring. This logic is able to describe software architectures with quantitative features such as the maximum (or minimum) cost, the probability or time needed of the interactions in the architecture. Given an architecture with weighted interactions we are able to construct a weighted formula which is able to characterize the way the components interact among with their respectively weights. Moreover, we show that given this formula we can compute all possible interactions in the architecture. In other words, we can compute all possible architecture schemes. Our first main result of this logic is that we prove that for every weighted formula we can effectively construct, in doubly exponential time, its equivalent one in full normal form which is unique up to the equivalence relation. So we get that two weighted formulas being equivalent iff they have the same full normal form. Hence, we do not need to check equality for all possible models of the architectures. The second main result of this work states that the equivalence of two weighted formulas is decidable. Moreover, we introduce a notion of soundness, and as a third main result we show that the aforementioned logic is sound. Next, by using the Maude system, which is an implementation of rewriting logic, we accomplish to compute the full normal form of every weighted formula in an automated way. We present the code with rewriting rules of our logic and the time performance of the code when we consider weighted formulas formalizing well known architectures. As we mentioned, the weighted propositional configuration logic over commutative semirings is able to characterize architectures with specific quantitative features. However, features such as the average cost of an architecture cannot be characterized with the aforementioned logic. This is due to the fact that the average operation cannot be expressed by the algebraic structure of commutative semirings. A structure that is able to express this operation is the one of product valuation monoids. For this, we introduce our second weighted logic which is a weighted propositional configuration logic over product valuation monoids. This logic is intended to serve as a specification language for software architectures with quantitative features such as the average of all interactions' costs of the architecture and the maximum cost among all costs occurring most frequently within a specific number of components in an architecture. We provide weighted formulas of our logic which describe well-known architectures equipped with quantitative characteristics. Moreover, we prove an efficient construction of a full normal form which leads to decidability of equivalence of formulas in this logic. Lastly, we introduce and investigate our third weighted logic which is the fuzzy propositional configuration logic. This logic is able to characterize quantitative features where the other weighted logics we introduced cannot. Those features are the uncertainty and the reliability of the interactions in an architecture. For this, we consider that fuzzy logics constitute a suitable tool in order to deal with uncertainty. The contributions of this logic are the following. We introduce the syntax and semantics of this logic which is a weighted propositional configuration logic over De Morgan algebras. We construct weighted formulas characterizing known architectures employed with uncertainty in their interactions. Then, we deal with the decidability of equivalence of formulas in our logic. Firstly, we show that every formula can be written in normal form in exponential time. Then, we prove that the equivalence problem of weighted formulas over an arbitrary De Morgan algebra is decidable in exponential time. Lastly, we deal with formulas which are not equivalent over an arbitrary De Morgan algebra but only over specific ones such as the Kleene and the Boolean algebra. For this, we prove that for every weighted formula over a Kleene algebra (resp. a Boolean algebra) we can effectively construct its equivalent weighted formula in normal form. Hence, the equivalence problem of weighted formulas over the aforementioned De Morgan algebras is decidable.

Degree

thesis:*
Grantor dc:publisher
Aristotle University Of Thessaloniki (AUTH)
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Paraponiari, Pavlina
  • Παραπονιάρη, Παυλίνα

Subjects

dc:subject × 29

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/56856

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Paraponiari, Pavlina; Παραπονιάρη, Παυλίνα. Quantitative architecture styles. Aristotle University Of Thessaloniki (AUTH), 2024. http://hdl.handle.net/10442/hedi/56856