Construction and properties of adhesive and weak adhesive high-level replacement categories

DOI10.1007/s10485-007-9106-3zbMath1143.18005OpenAlexW2067618962MaRDI QIDQ934669

Ulrike Prange, Hartmut Ehrig, Leen Lambers

Publication date: 30 July 2008

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10485-007-9106-3

zbMATH Keywords

coproductsadhesive HLR categoriesInitial pushoutspair factorization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Definitions and generalizations in theory of categories (18A05) Factorization systems, substructures, quotient structures, congruences, amalgams (18A32) Categories of machines, automata (18B20) Categorical structures (18D99)

Related Items

Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Towards the flexible reuse of model transformations: a formal approach based on graph transformation ⋮ Open-graphs and monoidal theories ⋮ Finitary -adhesive categories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Van Kampen theorems for categories of covering morphisms in lextensive categories
• Fundamentals of algebraic graph transformation
• Categories for Software Engineering
• Parallelism and concurrency in high-level replacement systems
• Graph Transformations
• Foundations of Software Science and Computation Structures
• Adhesive and quasiadhesive categories
• Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations