Finitary M-adhesive categories
From MaRDI portal
Publication:4931318
Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Factorization systems, substructures, quotient structures, congruences, amalgams (18A32) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(11)- Concurrency theorems for non-linear rewriting theories
- Transformations of reaction systems over categories by means of epi-mono factorization and functors
- Rule algebras for adhesive categories
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- Graph surfing in reaction systems from a categorial perspective
- Processes and unfoldings: concurrent computations in adhesive categories
- Finitary \(\mathcal{M}\)-adhesive categories
- Combining termination proofs in model transformation systems
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- A lattice-theoretical perspective on 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)