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.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Restricted to Registered users only Download (208Kb) | Request a copy |
Description/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.
| Item Type: | Article |
|---|---|
| Related URLs: | |
| Keywords: | adhesive categories, quasiadhesive categories, graph transformation, rewriting |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 263599 |
| Date Deposited: | 23 Feb 2007 |
| Last Modified: | 07 Mar 2012 15:41 |
| Contributors: | Lack, Stephen (Author) Sobocinski, Pawel (Author) |
| Date: | 2005 |
| Status: | Published |
| Publisher: | EDP Sciences |
| Further Information: | Google Scholar |
| ISI Citation Count: | 23 |
| URI: | http://eprints.soton.ac.uk/id/eprint/263599 |
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)
 |
View Item |
