scientific article
From MaRDI portal
Publication:3839056
zbMath0901.18003MaRDI QIDQ3839056
Publication date: 26 November 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
term rewriting systemsprocess algebrasrule-based systemsgraph transformationminimal closuredouble-pushoutdgs-monoidal category
Related Items
Executing bigraphical reactive systems ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Recognizable languages of arrows and cospans ⋮ Monoidal Width ⋮ Homotopy composition of cospans ⋮ Calculating Colimits Compositionally ⋮ Towards compositional graph theory ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Encoding bigraphical reactive systems into graph transformation systems ⋮ Hypergraph categories ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ GETGRATS ⋮ Recognizability of graph and pattern languages ⋮ A coalgebraic presentation of structured transition systems ⋮ An axiomatization of graphs ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Deriving Bisimulation Congruences: A 2-categorical Approach ⋮ Normal forms for algebras of connections. ⋮ A general framework for types in graph rewriting ⋮ Adhesive DPO Parallelism for Monic Matches ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
