DPO Rewriting and Abstract Semantics via Opfibrations

    Research output: Contribution to journalArticlepeer-review


    The classical DPO graph rewriting construction is re-expressed using the opfibration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as arrows, and with categories of redexes over each object in the base, yields a category of rewrites via the discrete Grothendieck construction. The various possible ways of combining rules and rewrites leads to a variety of functors amongst the various categories formed. Categories whose arrows are rewriting sequences have counterparts where the arrows are elementary event structures, and an event structure semantics for arbitrary graph grammars emerges naturally. © 1995 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)3-10
    Number of pages7
    JournalElectronic Notes in Theoretical Computer Science
    Issue numberC
    Publication statusPublished - 1995


    • DPO rewriting
    • event semantics
    • event structure
    • Graph grammar
    • opfibration


    Dive into the research topics of 'DPO Rewriting and Abstract Semantics via Opfibrations'. Together they form a unique fingerprint.

    Cite this