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.

中文翻译：

---

加权命题配置逻辑：具有定量特征的架构的规范语言

我们介绍并研究了可交换半环上的加权命题配置逻辑。我们的逻辑旨在作为具有定量特征的软件架构的规范语言。我们证明了该逻辑中公式的完全范式的有效构造和等价性的可判定性。我们通过在我们的逻辑中使用公式描述具有定量特征的众所周知的架构来说明这项工作的动机。