  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.
