Sesqui-Pushout Rewriting

From MaRDI portal
Publication:3541945

DOI10.1007/11841883_4zbMath1156.68423OpenAlexW1836559177MaRDI QIDQ3541945

Barbara König, Frank Hermann, Andrea Corradini, Tobias Heindel

Publication date: 27 November 2008

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

Full work available at URL: https://doi.org/10.1007/11841883_4




Related Items

An Institution for Graph TransformationEnsuring Correctness of Model Transformations While Remaining DecidableSesqui-Pushout Rewriting with Type RefinementsParallelism in AGREE TransformationsPullback in partial morphism categoriesDeduction as reduction, from a categorical point of viewPolymorphic Sesqui-Pushout Graph RewritingAGREE – Algebraic Graph Rewriting with Controlled EmbeddingMultilevel Typed Graph TransformationsRewriting Theory for the Life Sciences: A Unifying Theory of CTMC SemanticsFundamentals of compositional rewriting theoryComputational category-theoretic rewritingUnification of drags and confluence of drag rewritingGraph Transformation Units – An OverviewGraph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposesA lattice-theoretical perspective on adhesive categoriesHow to delete categorically -- two pushout complement constructionsAccretive computation of global transformationsUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemIncremental Update for Graph RewritingSubobject transformation systemsThe PBPO graph transformation approachKnowledge representation and update in hierarchies of graphsParallel coherent graph transformationsProcesses and unfoldings: concurrent computations in adhesive categoriesFinitary -adhesive categoriesAlgebraic graph rewriting with controlled embeddingOn the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systemsSingle pushout rewriting in comprehensive systems of graph-like structuresRewriting theory for the life sciences: a unifying theory of CTMC semanticsPartial pullback complement rewriting along admissible matchesA Heterogeneous Pushout Approach to Term-Graph TransformationMoment Semantics for Reversible Rule-Based SystemsModel Transformation and Induced Instance Migration: A Universal FrameworkConstructing optimized constraint-preserving application conditions for model transformation rulesComposition of multilevel domain-specific modelling languagesA generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applicationsRule-based transformation of graph rewriting rules: towards higher-order graph grammarsPartial pullback complement rewritingConcurrency theorems for non-linear rewriting theoriesGraph rewriting and relabeling with PBPO\textsuperscript{+}