Finitary M-adhesive categories
DOI10.1007/978-3-642-15928-2_16zbMATH Open1306.68121OpenAlexW1490620776MaRDI QIDQ4931318FDOQ4931318
Authors: Benjamin Braatz, Hartmut Ehrig, Karsten Gabriel, Ulrike Golas 
Publication date: 4 October 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15928-2_16
Recommendations
Grammars and rewriting systems (68Q42) Factorization systems, substructures, quotient structures, congruences, amalgams (18A32) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Cited In (11)
- Transformations of reaction systems over categories by means of epi-mono factorization and functors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Concurrency theorems for non-linear rewriting theories
- A lattice-theoretical perspective on adhesive categories
- Graph surfing in reaction systems from a categorial perspective
- Processes and unfoldings: concurrent computations in adhesive categories
- Combining termination proofs in model transformation systems
- Finitary \(\mathcal{M}\)-adhesive categories
- Rule algebras for adhesive categories
This page was built for publication: Finitary \(\mathcal{M}\)-adhesive categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931318)
