Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach
- A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, M. Löwe
- Computer ScienceHandbook of Graph Grammars
- 1 February 1997
This chapter starts with an overwiev of the basic notions common to the two algebraic approaches, the "double-pushout (DPO) approach) and the "single-push out (SPO) approaches"; next it is presented the classical theory and some recent development of the double- pushout approach.
Graph Grammars with Negative Application Conditions
- A. Habel, R. Heckel, G. Taentzer
- Computer Science, MathematicsFundamenta Informaticae
- 1 December 1996
The concept of application conditions introduced by Ehrig and Habel is restricted to contextual conditions, especially negative ones, and local confluence and the Parallelism Theorem for derivations with application conditions are state.
Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach
- H. Ehrig, R. Heckel, A. Corradini
- Mathematics, Computer ScienceHandbook of Graph Grammars
- 1 February 1997
Confluence of Typed Attributed Graph Transformation Systems
- R. Heckel, J. Küster, G. Taentzer
- Computer ScienceInternational Conference on Graph Transformation
- 7 October 2002
For this kind of attributed graph transformation systems, a definition of critical pairs is established and a critical pair lemma is proved, stating that local confluence follows from confluence of all critical pairs.
Graph Transformation in a Nutshell
- R. Heckel
- Computer ScienceFoVMT
- 1 February 2006
A methodology for specifying and analyzing consistency of object-oriented behavioral models
- G. Engels, J. Küster, R. Heckel, L. Groenewegen
- Computer ScienceESEC/FSE-9
- 10 September 2001
This paper discusses the issue of consistency of behavioral models in the UML and presents a general methodology how consistency problems can be dealt with and shows the applicability of the methodology by giving an example of a concrete consistency problem of concurrent object-oriented models.
Modeling and validation of service-oriented architectures: application vs. style
- L. Baresi, R. Heckel, S. Thöne, Dániel Varró
- Computer ScienceESEC/FSE-11
- 1 September 2003
This work proposes UML models of both the architectural style of the platform and the application scenario, and a formal interpretation of these as graphs and graph transformation systems is able to validate the consistency between platform and application.
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
The use of graph transformation is demonstrated to model object- and component-based systems and to specify syntax and semantics of diagram languages in software engineering.
Ensuring consistency of conditional graph rewriting - a constructive approach
- R. Heckel, Annika Wagner
- Computer Science, MathematicsSEGRAGRA
Rule-Based Specification of Behavioral Consistency Based on the UML Meta-model
- G. Engels, R. Heckel, J. Küster
- Computer ScienceInternational Conference on the Unified Modeling…
- 1 October 2001
Using meta-model rules, elements of UML models are transformed into a semantic domain and consistency constraints can be specified and validated using the language and the tools of the semantic domain.