Algebraic approach to single-pushout graph transformation
From MaRDI portal
Publication:685460
DOI10.1016/0304-3975(93)90068-5zbMath0787.18001OpenAlexW2127455123WikidataQ63406197 ScholiaQ63406197MaRDI QIDQ685460
Publication date: 15 May 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90068-5
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Related Items (72)
Theorem proving graph grammars with attributes and negative application conditions ⋮ Unfolding Grammars in Adhesive Categories ⋮ Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras ⋮ An Institution for Graph Transformation ⋮ Sesqui-Pushout Rewriting with Type Refinements ⋮ Unfolding semantics of graph transformation ⋮ Lambda calculus with explicit recursion ⋮ Relating graph and term rewriting via Böhm models ⋮ ESM systems and the composition of their computations ⋮ Parallelism in single-pushout graph rewriting ⋮ Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system ⋮ Polymorphic Sesqui-Pushout Graph Rewriting ⋮ AGREE – Algebraic Graph Rewriting with Controlled Embedding ⋮ Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems ⋮ A decade of TAPSOFT ⋮ On the expressive power of algebraic graph grammars with application conditions ⋮ Parallel high-level replacement systems ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ Algebraic transformation of unary partial algebras. I: Double-pushout approach ⋮ Single Pushout Rewriting in Comprehensive Systems ⋮ Patch Graph Rewriting ⋮ Fundamentals of compositional rewriting theory ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Computational category-theoretic rewriting ⋮ Explicit State Model Checking for Graph Grammars ⋮ Linear-Ordered Graph Grammars: Applications to Distributed Systems Design ⋮ Reversible causal graph dynamics: invertibility, block representation, vertex-preservation ⋮ Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes ⋮ Concurrent graph and term graph rewriting ⋮ Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unfolding-based diagnosis of systems with an evolving topology ⋮ Unnamed Item ⋮ Unfolding-Based Diagnosis of Systems with an Evolving Topology ⋮ Unnamed Item ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ SINGLE-PUSHOUT TRANSFORMATION OF TOTAL ALGEBRAS ⋮ The PBPO graph transformation approach ⋮ Monographs, a category of graph structures ⋮ Modelling Dynamic Software Architectures using Typed Graph Grammars ⋮ A partial algebras approach to graph transformation ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ Pragmatic and semantic aspects of a module concept for graph transformation systems ⋮ Synchronized composition of graph grammar productions ⋮ Formal relationship between graph grammars and Petri nets ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ Processes and unfoldings: concurrent computations in adhesive categories ⋮ Multi-amalgamation of rules with application conditions in -adhesive categories ⋮ Algebraic graph rewriting with controlled embedding ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Modelling and Verifying Mobile Systems Using π-Graphs ⋮ Graph Transformation by Computational Category Theory ⋮ A structural approach to graph transformation based on symmetric Petri nets ⋮ Topological grammars for data approximation ⋮ Correctness of high-level transformation systems relative to nested conditions ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Partial pullback complement rewriting along admissible matches ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation ⋮ Moment Semantics for Reversible Rule-Based Systems ⋮ Sound and Complete Abstract Graph Transformation ⋮ Comprehensive systems: a formal foundation for multi-model consistency management ⋮ Algebraic transformation of unary partial algebras II: Single-pushout approach ⋮ PUSHOUTS OF PARTIAL HOMOMORPHISMS OF PARTIAL ALGEBRAS II: CLOSED QUOMORPHISMS ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ Term-graph Rewriting in Tom Using Relative Positions ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars ⋮ Partial pullback complement rewriting ⋮ A generalized concurrent rule construction for double-pushout rewriting ⋮ Graph rewriting and relabeling with PBPO\textsuperscript{+}
Cites Work
- Hyperedge replacement: grammars and languages
- Parallel and distributed derivations in the single-pushout approach
- Characterizing specification languages which admit initial semantics
- On graph rewritings
- On ``On graph rewritings
- Categories of partial maps
- Graph grammars and operational semantics
- Amalgamation of graph transformations: a synchronization mechanism
- Pushout-Properties: An analysis of gluing constructions for graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algebraic approach to single-pushout graph transformation