AGG 2.0 - New features for specifying and analyzing algebraic graph transformations

20Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependency detection in transformations by critical pair analysis of graph rules, an important instrument to support the confluence check of graph transformation systems. AGG 2.0 includes various new features added over the past two years. It supports the specification of complex control structures for rule application comprising the definition of control and object flow for rule sequences and nested application conditions. Furthermore, new possibilities for constructing rules from existing ones (e.g., inverse, minimal, amalgamated, and concurrent rules) and for more flexible usability of critical pair analyses have been realized. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Runge, O., Ermel, C., & Taentzer, G. (2012). AGG 2.0 - New features for specifying and analyzing algebraic graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7233 LNCS, pp. 81–88). https://doi.org/10.1007/978-3-642-34176-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free