Graph transformation systems can be used for modeling the structure and the behavior of a software system in a visual way. In our project, we extend existing graph transformation systems to model and execute distributed systems. One challenge in this context is the simultaneous and correct modification of the local runtime graphs of the participating applications by visual distributed graph transformations. As the execution of these transformations may cause inconsistencies in the local runtime graphs, we present an approach to avoid inconsistencies: A runtime mechanism translates invalid graph transformations into valid transformations. This translation is based on predefined rules describing the substitution of invalid transformation parts. Thus, new graph transformations are dynamically built at runtime. Furthermore, the runtime mechanism controls access within a distributed system. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ranger, U., & Hermes, T. (2007). Ensuring consistency within distributed graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4422 LNCS, pp. 368–382). Springer Verlag. https://doi.org/10.1007/978-3-540-71289-3_28
Mendeley helps you to discover research relevant for your work.