Adhesivity with partial maps instead of spans
This paper is a journal version of a conference paper [Lect. Notes Comput. Sci. 6372, 250--265 (2010; Zbl 1306.68073)] presented at ICGT 2010. The main idea is to propose a new categorical framework for graph transformation and high-level replacement (HLR) systems, which generalizes adhesive categories and several variants introduced recently in the literature. The author proposes ``partial map adhesive categories based on heraditary pushoutsas a natural candidate for such a framework. In fact, several interesting properties are shown for this framework, which are fundamental for the theory of HLR systems including different kinds of graph and Petri net transformation systems. Moreover, partial map adhesivity can be shown via partial map classifiers leading to an interesting proof technique. Partial map adhesive categories are shown to be strictly more general than weak adhesive HLR categories. On the other hand partial map adhesive are also ``vertical weak adhesive HLR categories, but the equivalence of both is (stated as) an open problem. In contrast to the present paper vertical weak adhesive HLR categories are proposed in [the reviewer, \textit{U. Golas} and \textit{F. Hermann}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 102, 111--121 (2010; Zbl 1257.68092)] as a natural candidate for a general rewriting framework. In any case both approaches are very powerful and can benefit from each other.
- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Graph Transformations
- Adhesive high-level replacement systems: a new categorical framework for graph transformation
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
- Construction and properties of adhesive and weak adhesive high-level replacement categories
- Transformations in Reconfigurable Place/Transition Systems
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- Towards algebraic high-level systems as weak adhesive HLR categories
- Foundations of Software Science and Computation Structures
- Algebraic graph rewriting with controlled embedding
- Partial pullback complement rewriting along admissible matches
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Adhesive subcategories of functor categories with instantiation to partial triple graphs
- Partial pullback complement rewriting
- Adhesivity is not enough: local Church-Rosser revisited
- On pushouts of partial maps
- scientific article; zbMATH DE number 5000751 (Why is no real title available?)
- Adhesive high-level replacement systems: a new categorical framework for graph transformation
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Hereditary pushouts reconsidered
- 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
- 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 Generic Construction for Crossovers of Graph-Like Structures
- Partial pushout semantics of generics in DOL
- Construction and properties of adhesive and weak adhesive high-level replacement categories
This page was built for publication: Adhesivity with partial maps instead of spans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898462)
