• Publications
  • Influence
Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach
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
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.
Modeling and validation of service-oriented architectures: application vs. style
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.
Graph Transformation in a Nutshell
  • R. Heckel
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 1 February 2006
This paper provides a non-technical introduction to the basic concepts of typed graph transformation systems, completed by a survey of more advanced concepts, and explains some of its history and motivations.
A methodology for specifying and analyzing consistency of object-oriented behavioral models
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.
Ensuring consistency of conditional graph rewriting - a constructive approach
A general construction that transforms global consistency conditions into preconditions for individual rules is proposed that is motivated by an example specification of a safety-critical system that is, a roundabout.
Confluence of Typed Attributed Graph Transformation Systems
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.
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.
Style-based modeling and refinement of service-oriented architectures
This paper addresses the modeling of such architectures by refining business-oriented architectures, which abstract from technology aspects, into service-oriented ones, focusing on the ability of dynamic reconfiguration typical for SOA.