Weighted PCL over Product Valuation Monoids

Karyoti, Vagia; Paraponiari, Paulina

doi:10.1007/978-3-030-50029-0_19

Cited by 5 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, it would be interesting to investigate whether we could relax the idempotency property of the semiring K. Another work direction includes studying the concept of weighted connectors over more general structures than semirings, that are currently used in practical applications, for instance valuation monoids (cf. [DM11,KP20]). Another problem is developing a theory for modeling not only connectors but also the underlying behavior of component-based systems.…”

Section: Discussionmentioning

confidence: 99%

A formal algebraic approach for the quantitative modeling of connectors in architectures

Chrysovalanti¹,

Pittou²

2022

Preprint

View full text Add to dashboard Cite

In this paper we propose an algebraic formalization of connectors in the quantitative setting in order to address the performance issues related with the architectures of component-based systems. For this, we firstly introduce a weighted Algebra of Interactions over a set of ports and a commutative and idempotent semiring. The algebra serves sufficiently for modeling wellknown coordination schemes in the weighted setup. In turn, we introduce and study a weighted Algebra of Connectors over a set of ports and a commutative and idempotent semiring, which extends the weighted Algebra of Interactions with types that express two different modes of synchronization, in particular, Rendezvous and Broadcast. We show the expressiveness of the algebra by modeling several weighted connectors. Moreover, we derive two subalgebras, namely the weighted Algebra of Synchrons and of Triggers, and study their properties. Finally, we introduce a weighted congruence relation for connectors and provide conditions for proving congruence between distinct weighted connectors.

show abstract

Section: Discussionmentioning

confidence: 99%

A formal algebraic approach for the quantitative modeling of connectors in architectures

Chrysovalanti¹,

Pittou²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Moreover, it would be interesting to extend our logic-based framework for the investigation of dynamic and reconfigurable architectures [BJMS12, CST18, MG16] as well as for addressing the architecture composition problem [ABB + 16, BHM19]. Another research direction is the study of our logics over alternative weight structures, found in applications, like for instance valuation monoids [DM11,KP20]. Formal approaches for architectures are often extended with tools or graphical languages for supporting architectures' specification (cf.…”

Section: Modelling Of Parametric Architectures 26:31mentioning

confidence: 99%

“…Finally, according to our best knowledge the only weighted logic-based approach for the modelling of architectures is found in the recent work of [KP20,PR17,PR20a]. Specifically, in [PR17,PR20a] the authors studied PCL in the weighted setup for modelling the quantitative aspects of architectures.…”

Section: Introductionmentioning

confidence: 99%

“…Soundness was proved for that logic and the authors obtained the decidability for the equivalence problem of its formulas. In [KP20] the authors extended the work of [PR17,PR20a] and studied weighted PCL over a product valuation monoid. That algebraic structure allowed to compute the average cost as well as the maximum cost among all costs occurring most frequently for executing the interactions within architectures.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Architectures in parametric component-based systems: Qualitative and quantitative modelling

Pittou¹,

Rahonis²

2021

Logical Methods in Computer Science

View full text Add to dashboard Cite

One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address both the qualitative and non-functional aspects of architectures. In this paper we study the qualitative and quantitative formal modelling of architectures applied on parametric component-based systems, that consist of an unknown number of instances of each component. Specifically, we introduce an extended propositional interaction logic and investigate its first-order level which serves as a formal language for the interactions of parametric systems. Our logics achieve to encode the execution order of interactions, which is a main feature in several important architectures, as well as to model recursive interactions. Moreover, we prove the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures. We show the robustness of our theory by effectively extending our results for parametric weighted architectures. For this, we study the weighted counterparts of our logics over a commutative semiring, and we apply them for modelling the quantitative aspects of concrete architectures. Finally, we prove that the equivalence problem of weighted first-order extended interaction logic formulas is decidable in a large class of semirings, namely the class (of subsemirings) of skew fields.

show abstract