George Rahonis
YOU?
Author Swipe
Dynamic reconfiguration of component-based systems described by propositional configuration logic Open
We investigate dynamic reconfigurable component-based systems whose architectures are described by formulas of Propositional Configuration Logics. We present several examples of reconfigurable systems based on well-known architectures, and…
Architectures in parametric component-based systems: Qualitative and quantitative modelling Open
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 addres…
Weighted Context-Free Grammars Over Bimonoids Open
We introduce and investigate weighted context-free grammars over an arbitrary bimonoid K. Thus, we do not assume that the operations of K are commutative or idempotent or they distribute over each other. We prove a Chomsky-Schützenberger t…
Weighted parametric systems: Modelling and architecture specification Open
The design of complex software systems usually lies in multiple coordinating components with an unknown number of instances. For such systems a main challenge is modelling efficiently their architecture that determines the topology and the…
Modelling architectures of parametric weighted component-based systems Open
The design of complex software systems usually lies in multiple coordinating components with an unknown number of instances. For such systems a main challenge is modelling efficiently their architecture that determines the topology and the…
Architecture modelling of parametric component-based systems Open
Component-based design is a rigorous method for modelling large systems by coordinating multiple components. Communication principles can be described efficiently by architectures that characterize the permissible interactions and define t…
View article: MK-fuzzy Automata and MSO Logics
MK-fuzzy Automata and MSO Logics Open
We introduce MK-fuzzy automata over a bimonoid K which is related to the\nfuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and\nintend to contribute to, practical applications being in development in a\nproject on …
On weighted configuration logics Open
We introduce and investigate a weighted propositional configuration logic over a commutative semiring. Our logic, which is proved to be sound and complete, is intended to serve as a specification language for software architectures with qu…
Weighted Recognizability over Infinite Alphabets Open
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove that the class of their behaviors is closed under sum, and under scalar, Hadamard, Cauchy, and shuffle products, as well as star operation.…