Weighted PCL over product valuation monoids

02/25/2020
by   Vagia Karyoti, et al.
0

We introduce a weighted propositional configuration logic over a product valuation monoid. Our logic is intended to serve as a specification language for software architectures with quantitative features such as the average of all interactions' costs of the architecture and the maximum cost among all costs occurring most frequently within a specific number of components in an architecture. We provide formulas of our logic which describe well-known architectures equipped with quantitative characteristics. Moreover, we prove an efficient construction of a full normal form which leads to decidability of equivalence of formulas in this logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2019

Weighted parametric systems: Modelling and architecture specification

Modern systems' design usually lies in multiple components which are con...
research
05/14/2019

Weighted parametric systems: Modelling and architecture

Modern systems' design usually lies in multiple components which are con...
research
02/21/2019

Aperiodic Weighted Automata and Weighted First-Order Logic

By fundamental results of Schützenberger, McNaughton and Papert from the...
research
03/01/2023

Dynamic reconfiguration of component-based systems described by propositional configuration logic

We investigate dynamic reconfigurable component-based systems whose arch...
research
04/08/2021

Neural Network for Weighted Signal Temporal Logic

In this paper, we propose a neuro-symbolic framework called weighted Sig...
research
10/21/2021

A First Polynomial Non-Clausal Class in Many-Valued Logic

The relevance of polynomial formula classes to deductive efficiency moti...
research
09/22/2020

Learning Concepts Described by Weight Aggregation Logic

We consider weighted structures, which extend ordinary relational struct...

Please sign up or login with your details

Forgot password? Click here to reset