Adhesive Categories

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.

[1]  Vladimiro Sassone,et al.  A Calculus of Mobile Resources , 2002, CONCUR.

[2]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[3]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[4]  George Janelidze,et al.  Van Kampen theorems for categories of covering morphisms in lextensive categories , 1997 .

[5]  Fabio Gadducci,et al.  An inductive view of graph transformation , 1997, WADT.

[6]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[7]  Cosimo Laneve,et al.  Graphs for Core Molecular Biology , 2003, CMSB.

[8]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences: 2-Categories vs. Precategories , 2003 .

[9]  S. Lack,et al.  Introduction to extensive and distributive categories , 1993 .

[10]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[11]  Hartmut Ehrig,et al.  Concurrent semantics of algebraic graph transformations , 1999 .

[12]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[13]  Fabio Gadducci,et al.  A Concurrent Graph Semantics for Mobile Ambients , 2001, MFPS.

[14]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[15]  Robin Milner,et al.  Bigraphs and transitions , 2003, POPL '03.

[16]  Marco Pistore,et al.  Modeling concurrent, mobile and coordinated systems via graph transformations , 1999 .

[17]  Robin Milner,et al.  Bigraphical reactive systems: basic theory , 2001 .

[18]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[19]  Hartmut Ehrig,et al.  Applications, languages and tools , 1999 .

[20]  J. Robin B. Cockett,et al.  Restriction categories I: categories of partial maps , 2002, Theor. Comput. Sci..

[21]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[22]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences: 2-Categories Vs Precategories , 2003, FoSSaCS.

[23]  John Power,et al.  An Algebraic Foundation for Graph-based Diagrams in Computing , 2001, MFPS.

[24]  Hartmut Ehrig,et al.  From Graph Grammars to High Level Replacement Systems , 1990, Graph-Grammars and Their Application to Computer Science.

[25]  Robin Milner,et al.  Bigraphs and mobile processes , 2003 .

[26]  J. Robin B. Cockett,et al.  Restriction categories II: partial map classification , 2003, Theor. Comput. Sci..

[27]  Hartmut Ehrig,et al.  Concurrency, parallelism, and distribution , 1999 .

[28]  J. Benabou.  Introduction to bicategories , 1967 .

[29]  Hans-Jörg Kreowski,et al.  Transformationas of Derivation Sequences in Graph Grammars , 1977, FCT.