#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1982

2018

- This year (2)
- Last 5 years (11)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

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â€¦ (More)

- 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â€¦ (More)

- Annegret Habel
- Lecture Notes in Computer Science
- 1989

Where you can find the hyperedge replacement grammars and languages easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site. This bookâ€¦ (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â€¦ (More)

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

The framework of graph transformation combines the potentials and advantages of both, graphs and rules, to a single computational paradigm. In this paper we present some recent developments inâ€¦ (More)

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

- 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â€¦ (More)

- 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â€¦ (More)

- Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulrike Golas
- ICGT
- 2004

Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the well-known concept of HLRâ€¦ (More)