$\mathcal M, \mathcal N$ -Adhesive Transformation Systems
From MaRDI portal
Publication:2918983
DOI10.1007/978-3-642-33654-6_15zbMath1367.68135OpenAlexW184396603MaRDI QIDQ2918983
Publication date: 2 October 2012
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-33654-6_15
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) Categories of machines, automata (18B20)
Related Items (11)
Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Fundamentals of compositional rewriting theory ⋮ Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ Unnamed Item ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Confluence up to garbage in graph transformation ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Graph rewriting and relabeling with PBPO\textsuperscript{+}
This page was built for publication: $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
