Claudia Ermel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Claudia Ermel has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Gabriele Taentzer
Mathematics and Computer Science, Philipps-Universität Marburg, Marburg, Germany
4 shared publications Hartmut Ehrig
Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Sekr. FR6-1, Franklinstr. 28-29, 10587, Berlin, Germany
2 shared publications- Hartmut Ehrig
Technische Universität Berlin
2 shared publications - Leen Lambers
Brandenburg University of Technology Cottbus-Senftenberg
2 shared publications - Olga Runge
Technische Universität Berlin
2 shared publications Ulrike Prange
Technische Universität Berlin
2 shared publications
Latest Publications
- 1 January 2015
- Published by Springer Nature
- p. 582-601
Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation
- 1 January 2015
- Published by Springer Nature
- p. 582-601
Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation
- 1 February 2013
- Published by SAGE Publications in Computability
- Vol. 2 (1) , 31-49
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter k; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little systematic study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems (EDGE) CLIQUE COVER and PARTIAL CLIQUE COVER as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.
- 1 February 2013
- Published by SAGE Publications in Computability
- Vol. 2 (1) , 31-49
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter k; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little systematic study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems (EDGE) CLIQUE COVER and PARTIAL CLIQUE COVER as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.
- 25 April 2012
- Published by Springer Nature in Software and Systems Modeling
- Vol. 13 (1) , 239-272
A fundamental approach to model versioning based on graph modifications: from theory to implementation
- 25 April 2012
- Published by Springer Nature in Software and Systems Modeling
- Vol. 13 (1) , 239-272
A fundamental approach to model versioning based on graph modifications: from theory to implementation
- 25 March 2011
- Published by Springer Nature in Software and Systems Modeling
- Vol. 11 (2) , 227-250
Formal foundation of consistent EMF model transformations by algebraic graph transformation
- 25 March 2011
- Published by Springer Nature in Software and Systems Modeling
- Vol. 11 (2) , 227-250
Formal foundation of consistent EMF model transformations by algebraic graph transformation
- Open Access
- 1 January 2011
- Published by Springer Nature
- p. 156-170
Modeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior
- 1 January 2011
- Published by Springer Nature
- p. 156-170
Open AccessModeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior
- Open Access
- 26 May 2010
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 12 (3-4) , 245-261
Introduction to AGG and EMF Tiger by modeling a Conference Scheduling System
- 26 May 2010
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 12 (3-4) , 245-261
Open AccessIntroduction to AGG and EMF Tiger by modeling a Conference Scheduling System
- Open Access
- 1 May 2010
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 22 (3) , 327-344
Consistent integration of models based on views of meta models
The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to generalized typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models (Theorem 4.1) and extend these conditions to view models defined over meta models with constraints (Theorem 5.1). As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.
- 1 May 2010
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 22 (3) , 327-344
Open AccessConsistent integration of models based on views of meta models
The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to generalized typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models (Theorem 4.1) and extend these conditions to view models defined over meta models with constraints (Theorem 5.1). As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.
- 1 January 2003
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 83-108
Generation of Animation Views for Petri Nets in GenGED
- 1 January 2003
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 83-108
Generation of Animation Views for Petri Nets in GenGED