#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1974

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Frank Drewes, Hans-Jörg Kreowski, Annegret Habel
- Handbook of Graph Grammars
- 1997

In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and… (More)

- Annegret Habel
- Lecture Notes in Computer Science
- 1989

- Annegret Habel, Karl-Heinz Pennemann
- Mathematical Structures in Computer Science
- 2009

We introduce the notions of nested constraints and application conditions, short nested conditions. For a category associated with a graphical representation such as graphs, conditions are a graphical and intuitive, yet precise formalism, well-suited to describe structural properties. We show that nested graph conditions are expressively equivalent to… (More)

- Annegret Habel, Reiko Heckel, Gabriele Taentzer
- Fundam. Inform.
- 1996

In each graph-grammar approach it is deened how and under which conditions graph productions can be applied to a given graph in order to obtain a derived graph. The conditions under which productions can be applied are called application conditions. Although the generative power of most of the known general graph-grammar approaches is suucient to generate… (More)

- Marc Andries, Gregor Engels, +6 authors Gabriele Taentzer
- Sci. Comput. Program.
- 1999

The aim of this paper is to survey some recent trends in applied graph transformation as a rule based framework for the speciication and development of systems, languages, and tools. After recalling the basic features of graph transformation, we discuss a spectrum of applications including term graph rewriting, the speciication of the Agg-system, the… (More)

- Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce
- Mathematical Structures in Computer Science
- 1991

- Annegret Habel, Jürgen Müller, Detlef Plump
- Mathematical Structures in Computer Science
- 2001

In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. We show that injective matching provides… (More)

- Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce
- Graph-Grammars and Their Application to Computer…
- 1990

G ~ C ~i ' -H The top row L ~-K --> R is a production p with left hand side L, right hand side R, and interface K. Given a context C and morphism K ---> C the gluing of L with C along K leads to G, the pusbout object in the left diagram (1). The gluing

- Paul Boehm, Harald-Reto Fonio, Annegret Habel
- J. Comput. Syst. Sci.
- 1987

- Annegret Habel, Karl-Heinz Pennemann, Arend Rensink
- ICGT
- 2006

In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application… (More)