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] 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 Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 263599
Date Deposited: 23 Feb 2007
Last Modified: 27 Mar 2014 20:07
Further Information:Google Scholar
ISI Citation Count:23
URI: http://eprints.soton.ac.uk/id/eprint/263599

Available Versions of this Item

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics