Fuzzy propositional configuration logics

TL;DR

This paper introduces a weighted propositional configuration logic over De Morgan algebras to model and analyze software architectures with quantitative features like uncertainty, providing methods for formula equivalence and illustrating applications with examples.

Contribution

It presents a novel weighted logic framework for software architecture modeling that accounts for uncertainty and provides a method to determine formula equivalence within this logic.

Findings

Formulas can be transformed into a specific normal form.

Equivalence of formulas depends on the underlying De Morgan algebra.

Examples demonstrate the logic's applicability to real software architectures.

Abstract

We introduce and investigate a weighted propositional configuration logic over De Morgan algebras. This logic is able to describe software architectures with quantitative features such as the uncertainty of the interactions that occur in the architecture. We deal with the equivalence problem of formulas in our logic by proving that every formula can be written in a specific form. To our surprise, there are formulas which are equivalent only over specific De Morgan algebras. We provide examples of formulas in our logic which describe well-known software architectures equipped with quantitative features.