Enhanced graph rewriting systems for complex software domains

Abstract

Methodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination.

Multiscale and Multiobjective modelling: A perspective for mastering the design and operation complexity of IoT systems

“…These models can also describe the topology of a network for which the graph represents the information propagation paths at various levels ranging from a representation of the neighborhood links in a sensor network to the relations of acquaintance in social networking or collaborative network platforms. The modeling can be based on conceptual graphs and graph grammars [2]. We can consider an initial graph and a set of transformation rules that characterize the set of the possible reachable configurations without their explicit enumeration.…”

Enhanced graph rewriting systems for complex software domains (SoSyM abstract)

“…This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination. This is an extended abstract for the Models 2015 Conference of the journal paper of the same name [1].…”