Enhanced Graph Rewriting Systems for Complex Software Domain

Cédric Eichler (1) , Thierry Monteil (2) , Patricia Stolf (1) , Luigi Alfredo Grieco (3) , Khalil Drira (2)

1 IRIT-SEPIA - Système d’exploitation, systèmes répartis, de l’intergiciel à l’architecture
2 LAAS-SARA - Équipe Services et Architectures pour Réseaux Avancés
3 DEE - Dipartimento di Elettrotecnica ed Elettronica [Bari]

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.

Mots clés: Constrained and attributed rewriting systems; Graph rewriting systems; Non-functional requirements

Domaines: Architectures Matérielles [cs.AR]

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⟩