Algebraic approach to single-pushout graph transformation

From MaRDI portal
Publication:685460

DOI10.1016/0304-3975(93)90068-5zbMath0787.18001OpenAlexW2127455123WikidataQ63406197 ScholiaQ63406197MaRDI QIDQ685460

Michael Löwe

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




Related Items (72)

Theorem proving graph grammars with attributes and negative application conditionsUnfolding Grammars in Adhesive CategoriesAllegories and Collagories for Transformation of Graph Structures Considered as CoalgebrasAn Institution for Graph TransformationSesqui-Pushout Rewriting with Type RefinementsUnfolding semantics of graph transformationLambda calculus with explicit recursionRelating graph and term rewriting via Böhm modelsESM systems and the composition of their computationsParallelism in single-pushout graph rewritingAmalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar systemPolymorphic Sesqui-Pushout Graph RewritingAGREE – Algebraic Graph Rewriting with Controlled EmbeddingCharacterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation SystemsA decade of TAPSOFTOn the expressive power of algebraic graph grammars with application conditionsParallel high-level replacement systemsA Port Graph Rewriting Approach to Relational Database ModellingAlgebraic transformation of unary partial algebras. I: Double-pushout approachSingle Pushout Rewriting in Comprehensive SystemsPatch Graph RewritingFundamentals of compositional rewriting theoryDouble-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphsComputational category-theoretic rewritingExplicit State Model Checking for Graph GrammarsLinear-Ordered Graph Grammars: Applications to Distributed Systems DesignReversible causal graph dynamics: invertibility, block representation, vertex-preservationGraph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposesConcurrent graph and term graph rewritingApplying the Graph Minor Theorem to the Verification of Graph Transformation SystemsUnnamed ItemUnnamed ItemUnnamed ItemUnfolding-based diagnosis of systems with an evolving topologyUnnamed ItemUnfolding-Based Diagnosis of Systems with an Evolving TopologyUnnamed ItemStrategic port graph rewriting: an interactive modelling frameworkSINGLE-PUSHOUT TRANSFORMATION OF TOTAL ALGEBRASThe PBPO graph transformation approachMonographs, a category of graph structuresModelling Dynamic Software Architectures using Typed Graph GrammarsA partial algebras approach to graph transformationOn the interleaving semantics of transformation units — A step into GRACEPragmatic and semantic aspects of a module concept for graph transformation systemsSynchronized composition of graph grammar productionsFormal relationship between graph grammars and Petri netsParallel and distributed derivations in the single-pushout approachProcesses and unfoldings: concurrent computations in adhesive categoriesMulti-amalgamation of rules with application conditions in -adhesive categoriesAlgebraic graph rewriting with controlled embeddingOn the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systemsModelling and Verifying Mobile Systems Using π-GraphsGraph Transformation by Computational Category TheoryA structural approach to graph transformation based on symmetric Petri netsTopological grammars for data approximationCorrectness of high-level transformation systems relative to nested conditionsSingle pushout rewriting in comprehensive systems of graph-like structuresTransformation rules with nested application conditions: critical pairs, initial conflicts \& minimalityPartial pullback complement rewriting along admissible matchesA Heterogeneous Pushout Approach to Term-Graph TransformationMoment Semantics for Reversible Rule-Based SystemsSound and Complete Abstract Graph TransformationComprehensive systems: a formal foundation for multi-model consistency managementAlgebraic transformation of unary partial algebras II: Single-pushout approachPUSHOUTS OF PARTIAL HOMOMORPHISMS OF PARTIAL ALGEBRAS II: CLOSED QUOMORPHISMSA generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applicationsTerm-graph Rewriting in Tom Using Relative PositionsRule-based transformation of graph rewriting rules: towards higher-order graph grammarsPartial pullback complement rewritingA generalized concurrent rule construction for double-pushout rewritingGraph rewriting and relabeling with PBPO\textsuperscript{+}



Cites Work


This page was built for publication: Algebraic approach to single-pushout graph transformation