Abstract
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
| Original language | English |
|---|---|
| Journal | Theoretical Informatics and Applications |
| Publication status | Published - 2005 |
Keywords
- adhesive categories
- category theory
- electronic data processing
- graph rewriting
- quasiadhesive categories