An inductive view of graph transformation

DOI10.1007/3-540-64299-4_36MaRDI QIDQ3839056zbMATH OpenFDO

Authors Fabio Gadducci, R. Heckel

Publication date 26 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-64299-4_36

zbMATH Keywords

dgs-monoidal categorydouble-pushoutgraph transformationminimal closureprocess algebrasrule-based systemsterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Algebraic approach to graph transformation based on single pushout derivations
• From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
• Double-pushout graph transformation revisited

Cited in

(32)

• Synthesising CCS bisimulation using graph rewriting
• Executing bigraphical reactive systems
• Normal forms for algebras of connections.
• Hypergraph categories
• Recognizability of graph and pattern languages
• A general framework for types in graph rewriting
• Deriving bisimulation congruences: a 2-categorical approach
• Adhesive DPO parallelism for monic matches
• An institution for graph transformation
• Confluence of graph rewriting with interfaces
• Calculating Colimits Compositionally
• scientific article; zbMATH DE number 1136656 (Why is no real title available?)
• scientific article; zbMATH DE number 1953883 (Why is no real title available?)
• Recognizable languages of arrows and cospans
• Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
• GETGRATS: a summary of scientific results (with annotated bibliography)
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• Encoding bigraphical reactive systems into graph transformation systems
• A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
• Homotopy composition of cospans
• String diagram rewrite theory III: Confluence with and without Frobenius
• A coalgebraic presentation of structured transition systems
• Towards compositional graph theory
• Monoidal Width
• A monoidal view on fixpoint checks
• A monoidal view on fixpoint checks
• Finite automata for efficient graph recognition
• An axiomatization of graphs
• The calculus of neo-Peircean relations
• Double categories of open systems: the cospan approach
• Rewriting structured cospans

This page was built for publication: An inductive view of graph transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839056)