Double-pushout graph transformation revisited
From MaRDI portal
Publication:2762625
DOI10.1017/S0960129501003425zbMath0987.18005OpenAlexW2164661513MaRDI QIDQ2762625
Jürgen Müller, Detlef Plump, Annegret Habel
Publication date: 15 June 2002
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129501003425
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Categorical semantics of formal languages (18C50)
Related Items
Labelled graph strategic rewriting for social networks, Rewriting Strategies and Strategic Rewrite Programs, Confluence up to Garbage, Patch Graph Rewriting, Graph Parsing as Graph Transformation, Categorifying the ZX-calculus, A decentralised graphical implementation of mobile ambients, Unnamed Item, Unnamed Item, Unnamed Item, Strategic port graph rewriting: an interactive modelling framework, GETGRATS, Basic Results for Two Types of High-Level Replacement Systems, On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems, Correctness of high-level transformation systems relative to nested conditions, Confluence up to garbage in graph transformation, Labelled Graph Rewriting Meets Social Networks, Monadic second-order incorrectness logic for GP 2, Adhesive DPO Parallelism for Monic Matches, Modeling Pointer Redirection as Cyclic Term-graph Rewriting, On Term-Graph Rewrite Strategies, Hierarchical graph transformation, Rule-based transformation of graph rewriting rules: towards higher-order graph grammars, Graph rewriting and relabeling with PBPO\textsuperscript{+}, String diagram rewrite theory III: Confluence with and without Frobenius
