Enhanced Graph Rewriting Systems for Complex Software Domain - Archive ouverte HAL Access content directly
Journal Articles Software and Systems Modeling Year : 2016

Enhanced Graph Rewriting Systems for Complex Software Domain

(1) , (2) , (1) , (3) , (2)


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.
Fichier principal
Vignette du fichier
artSoSym.pdf (1.48 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01057731 , version 1 (25-08-2014)



Cédric Eichler, Thierry Monteil, Patricia Stolf, Luigi Alfredo Grieco, Khalil Drira. Enhanced Graph Rewriting Systems for Complex Software Domain. Software and Systems Modeling, 2016, 15 (3), pp.685-705. ⟨10.1007/s10270-014-0433-1⟩. ⟨hal-01057731⟩
284 View
282 Download



Gmail Facebook Twitter LinkedIn More