Adhesive and quasiadhesive categories
Lack, Stephen and Sobocinski, Pawel (2005) Adhesive and quasiadhesive categories. Theoretical Informatics and Applications, 39, (2), 522-546.
This is the latest version of this item.
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:||adhesive categories, quasiadhesive categories, graph transformation, rewriting|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||23 Feb 2007|
|Last Modified:||07 Mar 2012 15:41|
|Contributors:||Lack, Stephen (Author)
Sobocinski, Pawel (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||23|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Available Versions of this Item
Adhesive and quasiadhesive categories. (deposited 01 Feb 2007)
- Adhesive and quasiadhesive categories. (deposited 23 Feb 2007) [Currently Displayed]
Actions (login required)