Adhesive and quasiadhesive categories
Top Cited Papers
- 15 July 2005
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 39 (3) , 511-545
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.Keywords
This publication has 20 references indexed in Scilit:
- Introduction to the algebraic theory of graph grammars (a survey)2005
- From graph grammars to high level replacement systems2005
- Adhesive Categories2004
- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting2004
- Graphs for Core Molecular Biology2003
- CONCURRENT SEMANTICS OF ALGEBRAIC GRAPH TRANSFORMATIONS1999
- Van Kampen theorems for categories of covering morphisms in lextensive categoriesJournal of Pure and Applied Algebra, 1997
- Introduction to extensive and distributive categoriesJournal of Pure and Applied Algebra, 1993
- Transformations of derivation sequences in graph grammarsLecture Notes in Computer Science, 1977
- Graph-grammars: An algebraic approach1973