Weighted propositional configuration logics: a specification language for architectures with quantitative features
From MaRDI portal
Publication:2064516
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.
Recommendations
- Configuration logics: modeling architecture styles
- Weight assignment logic
- A quantitative characterization of weighted Kripke structures in temporal logic
- Weighted modal transition systems
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
Cites work
- A general framework for architecture composability
- Configuration logics: modeling architecture styles
- Handbook of weighted automata
- Metamathematics of fuzzy logic
- Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms
- Weighted automata and weighted MSO logics for average and long-time behaviors
Cited in
(5)- Modelling Uncertainty in Architectures of Parametric Component-Based Systems
- Fuzzy Propositional Configuration Logics
- Weighted propositional configuration logic over De Morgan algebras
- scientific article; zbMATH DE number 7471686 (Why is no real title available?)
- A formal algebraic approach for the quantitative modeling of connectors in architectures
This page was built for publication: Weighted propositional configuration logics: a specification language for architectures with quantitative features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064516)