Adhesive and quasiadhesive categories

DOI10.1051/ita:2005028zbMath1078.18010OpenAlexW2054776476MaRDI QIDQ5313719

Publication date: 1 September 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_3_511_0

zbMATH Keywords

graph rewriting category theory extensive categories adhesive categories quasiadhesive categories

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical structures (18D99)

Related Items (78)

Van Kampen Colimits as Bicolimits in Span ⋮ Unfolding Grammars in Adhesive Categories ⋮ Incremental Concurrent Model Synchronization using Triple Graph Grammars ⋮ Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras ⋮ An Institution for Graph Transformation ⋮ Unnamed Item ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ Sesqui-Pushout Rewriting with Type Refinements ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Tensors, !-graphs, and non-commutative quantum structures ⋮ Unfolding semantics of graph transformation ⋮ Recognizable languages of arrows and cospans ⋮ Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ Finite limits and anti-unification in substitution categories ⋮ Constructing constraint-preserving interaction schemes in adhesive categories ⋮ Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Fundamentals of compositional rewriting theory ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Specifying graph languages with type graphs ⋮ Computational category-theoretic rewriting ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ A Category of Surface-Embedded Graphs ⋮ Dependent Optics ⋮ A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A lattice-theoretical perspective on adhesive categories ⋮ Symbolic graphs for attributed graph constraints ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ The Greenberg Functor is Site Cocontinuous ⋮ Accretive computation of global transformations ⋮ Unnamed Item ⋮ Unfolding-based diagnosis of systems with an evolving topology ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lex colimits ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Unnamed Item ⋮ Unfolding-Based Diagnosis of Systems with an Evolving Topology ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Subobject transformation systems ⋮ The PBPO graph transformation approach ⋮ Some facets of Horn covarieties in a category ⋮ Monographs, a category of graph structures ⋮ Equilibrium and termination II: the case of Petri nets ⋮ Towards Secrecy for Rewriting in Weakly Adhesive Categories ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ Processes and unfoldings: concurrent computations in adhesive categories ⋮ Finitary -adhesive categories ⋮ RPO semantics for mobile ambients ⋮ Multi-amalgamation of rules with application conditions in -adhesive categories ⋮ -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation ⋮ Formal analysis of model transformations based on triple graph grammars ⋮ Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions ⋮ Collagories: relation-algebraic reasoning for gluing constructions ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Unnamed Item ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ A categorial approach to reaction systems: first steps ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ New wide classes of weakly Mal'tsev categories ⋮ Partial pullback complement rewriting along admissible matches ⋮ Moment Semantics for Reversible Rule-Based Systems ⋮ Constructing optimized constraint-preserving application conditions for model transformation rules ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions ⋮ Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories ⋮ Adhesive DPO Parallelism for Monic Matches ⋮ Modelling Calculi with Name Mobility using Graphs with Equivalences ⋮ Rule Algebras for Adhesive Categories ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars ⋮ Partial pullback complement rewriting ⋮ Concurrency theorems for non-linear rewriting theories ⋮ A generalized concurrent rule construction for double-pushout rewriting ⋮ Transformations of reaction systems over categories by means of epi-mono factorization and functors ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Cites Work

This page was built for publication: Adhesive and quasiadhesive categories