# Weighted propositional configuration logics: A specification language for architectures with quantitative features

## TL;DR

This paper presents a weighted propositional configuration logic over commutative semirings designed as a specification language for software architectures with quantitative features, including normal form construction and formula equivalence decidability.

## Contribution

It introduces a novel weighted logic for architecture specifications, providing normal forms and decidability results for formulas involving quantitative features.

## Key findings

- Normal form construction is efficient
- Decidability of formula equivalence is established
- Application to well-known architectures with quantitative traits

## Abstract

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient construction of full normal forms and decidability of equivalence of formulas in this logic. We illustrate the motivation of this work by describing well-known architectures equipped with quantitative characteristics using formulas in our logic.