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 |
---|---|
Pages (from-to) | 511-545 |
Number of pages | 35 |
Journal | RAIRO - Theoretical Informatics and Applications |
Volume | 39 |
Issue number | 3 |
DOIs | |
Publication status | Published - Jul 2005 |
Externally published | Yes |
Keywords
- Adhesive categories
- Category theory
- Extensive categories
- Graph rewriting
- Quasiadhesive categories