On the public citation graph

Confluence of Graph Transformation Revisited

0 signed · 98 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/mana.19790910111openalex-snapshot

Pushout‐Properties: An analysis of gluing constructions for graphs

inferredcites →https://doi.org/10.1006/jvlc.1996.0027openalex-snapshot

Defining and Parsing Visual Languages with Layered Graph Grammars

inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot

Improved On-Line Broadcast Scheduling with Deadlines

inferredcites →https://doi.org/10.1007/3-540-07854-1openalex-snapshot

Mathematical Foundations of Computer Science 1976

inferredcites →https://doi.org/10.1007/3-540-07854-1_188openalex-snapshot

Parallelism of manipulations in multidimensional information structures

inferredcites →https://doi.org/10.1007/3-540-08442-8_91openalex-snapshot

Embedding Theorems in the Algebraic Theory of Graph Grammars

inferredcites →https://doi.org/10.1007/3-540-45832-8_14openalex-snapshot

Confluence of Typed Attributed Graph Transformation Systems

inferredcites →https://doi.org/10.1007/3-540-55121-2_4openalex-snapshot

Graph rewriting systems and their application to network reliability analysis

inferredcites →https://doi.org/10.1007/3-540-61332-3_153openalex-snapshot

Reduction algorithms for constructing solutions in graphs with small treewidth

inferredcites →https://doi.org/10.1007/978-3-540-30203-2_11openalex-snapshot

Towards Graph Programs for Graph Algorithms

inferredcites →https://doi.org/10.1007/978-3-540-30203-2_12openalex-snapshot

Adhesive High-Level Replacement Categories and Systems

inferredcites →https://doi.org/10.1007/978-3-540-30203-2_13openalex-snapshot

Fundamental Theory for Typed Attributed Graph Transformation

inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot

Simple Word Problems in Universal Algebras

inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot

Deriving graphs from graphs by applying a production

inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot

Transformations of structures: An algebraic approach

inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot

Graph-Grammars and Their Application to Computer Science and Biology

inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot

Introduction to the algebraic theory of graph grammars (a survey)

inferredcites →https://doi.org/10.1016/0001-8708(91)90045-9openalex-snapshot

Abstract and concrete categories

inferredcites →https://doi.org/10.1016/0304-3975(84)90021-5openalex-snapshot

On graph rewritings

inferredcites →https://doi.org/10.1016/0890-5401(90)90023-bopenalex-snapshot

On ground-confluence of term rewriting systems

inferredcites →https://doi.org/10.1017/9781009498968.017openalex-snapshot

Term Rewriting Systems

inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot

Term Rewriting and All That

inferredcites →https://doi.org/10.1017/s0960129501003425openalex-snapshot

Double-pushout graph transformation revisited

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/sfcs.1976.17openalex-snapshot

Graph grammars and global program data flow analysis

inferredcites →https://doi.org/10.1142/9789812384720openalex-snapshot

Handbook of Graph Grammars and Computing by Graph Transformation

inferredcites →https://doi.org/10.1142/9789812384720_0003openalex-snapshot

ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION – PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH

inferredcites →https://doi.org/10.1142/9789812815149_0001openalex-snapshot

TERM GRAPH REWRITING

inferredcites →https://doi.org/10.1142/9789812815149_0013openalex-snapshot

THE PROGRES APPROACH: LANGUAGE AND ENVIRONMENT

inferredcites →https://doi.org/10.1142/9789812815149_0014openalex-snapshot

THE AGG APPROACH: LANGUAGE AND ENVIRONMENT

inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot

An algebraic theory of graph reduction

inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

inferredcites →https://doi.org/10.2307/1968867openalex-snapshot

On Theories with a Combinatorial Definition of "Equivalence"

inferredcites →https://doi.org/10.2307/2005152openalex-snapshot

Computational Problems in Abstract Algebra

inferredcites →https://doi.org/10.2307/2325048openalex-snapshot

Abstract and Concrete Categories.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11841883_6openalex-snapshot

Conflict Detection for Graph Transformation with Negative Application Conditions

inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_14openalex-snapshot

Graph Consistency as a Graduated Property

inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_2openalex-snapshot

Confluence up to Garbage

inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_7openalex-snapshot

Initial Conflicts for Transformation Rules with Nested Application Conditions

inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_8openalex-snapshot

Patch Graph Rewriting

inferred← citeshttps://doi.org/10.1007/978-3-030-78946-6_15openalex-snapshot

Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars

inferred← citeshttps://doi.org/10.1007/978-3-031-64285-2_8openalex-snapshot

Using Application Conditions to Rank Graph Transformations for Graph Repair

inferred← citeshttps://doi.org/10.1007/978-3-319-50230-4_11openalex-snapshot

Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem

inferred← citeshttps://doi.org/10.1007/978-3-319-72044-9_11openalex-snapshot

Towards Critical Pair Analysis for the Graph Programming Language GP 2

inferred← citeshttps://doi.org/10.1007/978-3-319-74730-9_8openalex-snapshot

Checking Graph Programs for Confluence

inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6_13openalex-snapshot

Modular Termination of Graph Transformation

inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_12openalex-snapshot

Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_12openalex-snapshot

Embedding and Confluence of Graph Transformations with Negative Application Conditions

inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_15openalex-snapshot

High-Level Programs and Program Conditions

inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_48openalex-snapshot

Development of Correct Graph Transformation Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-02408-5_6openalex-snapshot

A Collection Operator for Graph Transformation

inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_54openalex-snapshot

Research Summary

inferred← citeshttps://doi.org/10.1007/978-3-642-03848-8_7openalex-snapshot

Towards Algorithmic Generation of Business Processes: From Business Step Dependencies to Process Algebra Expressions

inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_11openalex-snapshot

Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars

inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_22openalex-snapshot

Local Confluence for Rules with Nested Application Conditions

inferred← citeshttps://doi.org/10.1007/978-3-642-24485-8_19openalex-snapshot

Semantic Clone Detection for Model-Based Development of Embedded Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_19openalex-snapshot

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization

inferred← citeshttps://doi.org/10.1007/s10270-011-0190-3openalex-snapshot

A collection operator for graph transformation

inferred← citeshttps://doi.org/10.1007/s10270-011-0212-1openalex-snapshot

Confluence of aspects for sequence diagrams

inferred← citeshttps://doi.org/10.1007/s11334-024-00587-wopenalex-snapshot

Empowering model repair: a rule-based approach to graph repair without side effects—extended version

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.019openalex-snapshot

Strong Joinability Analysis for Graph Transformation Systems in CHR

inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100482openalex-snapshot

On the essence and initiality of conflicts in M -adhesive transformation systems

inferred← citeshttps://doi.org/10.1016/j.scico.2021.102729openalex-snapshot

Sustaining and improving graduated graph consistency: A static analysis of graph transformations

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.032openalex-snapshot

Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.025openalex-snapshot

Parallel rewriting of attributed graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.010openalex-snapshot

Confluence up to garbage in graph transformation

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.023openalex-snapshot

Transformation rules with nested application conditions: Critical pairs, initial conflicts & minimality

inferred← citeshttps://doi.org/10.1017/s096012950700610xopenalex-snapshot

Graph rewriting for the π-calculus

inferred← citeshttps://doi.org/10.1017/s0960129512000357openalex-snapshot

-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

inferred← citeshttps://doi.org/10.1017/s0960129512000370openalex-snapshot

Formal analysis of model transformations based on triple graph grammars

inferred← citeshttps://doi.org/10.1017/s1471068410000438openalex-snapshot

Analysing graph transformation systems through constraint handling rules

inferred← citeshttps://doi.org/10.1109/icst.2012.197openalex-snapshot

A Tridimensional Approach for Studying the Formal Verification of Model Transformations

inferred← citeshttps://doi.org/10.1109/models-c59198.2023.00132openalex-snapshot

Empowering Model Repair: A Rule-Based Approach to Graph Repair Without Side Effects

inferred← citeshttps://doi.org/10.1115/1.4032576openalex-snapshot

Designing the Same, but in Different Ways: Determinism in Graph-Rewriting Systems for Function-Based Design Synthesis

inferred← citeshttps://doi.org/10.1142/s0218194017500139openalex-snapshot

A Specification and Detection Approach for Parallel Evolution Conflicts of Software Architectures

inferred← citeshttps://doi.org/10.1145/1140335.1140350openalex-snapshot

Rewriting term-graphs with priority

inferred← citeshttps://doi.org/10.1145/2568225.2568267openalex-snapshot

Lifting model transformations to product lines

inferred← citeshttps://doi.org/10.1145/3479394.3479405openalex-snapshot

A Superposition-Based Calculus for Diagrammatic Reasoning

inferred← citeshttps://doi.org/10.1145/3502719openalex-snapshot

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure

inferred← citeshttps://doi.org/10.11606/t.45.2008.tde-27102008-100359openalex-snapshot

Geração de expressões algébricas para processos de negócio usando reduções de digrafos série-paralelo

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.26.363openalex-snapshot

Parallelism and Concurrency Theorems for Rules with Nested Application Conditions

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.26.367openalex-snapshot

Checking Graph-Transformation Systems for Confluence

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.4.15openalex-snapshot

Termination of Algebraic Rewriting with Inhibitors

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.68.953openalex-snapshot

Towards Model Checking Reconfigurable Petri Nets using Maude

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.71.1002openalex-snapshot

A Unification Algorithm for GP 2

inferred← citeshttps://doi.org/10.4204/eptcs.181.1openalex-snapshot

Confluence Detection for Transformations of Labelled Transition Systems

inferred← citeshttps://doi.org/10.4204/eptcs.225.6openalex-snapshot

Reasoning about Graph Programs

inferred← citeshttps://doi.org/10.4204/eptcs.82.1openalex-snapshot

The Design of GP 2

inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.191openalex-snapshot

Conditional Reactive Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1006.1497openalex-snapshot

Analyzing Graph Transformation Systems through Constraint Handling Rules

inferred← citeshttps://doi.org/10.48550/arxiv.1705.02171openalex-snapshot

A Unification Algorithm for GP 2 (Long Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1906.05170openalex-snapshot

Efficient Graph Rewriting

inferred← citeshttps://doi.org/10.48550/arxiv.1911.12884openalex-snapshot

Efficient Recognition of Graph Languages

inferred← citeshttps://doi.org/10.48550/arxiv.2003.06488openalex-snapshot

Patch Graph Rewriting (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.2005.04162openalex-snapshot

Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations

inferred← citeshttps://doi.org/10.5381/jot.2015.14.1.a3openalex-snapshot

A Survey of Formal Verification Techniques for Model Transformations: A Tridimensional Classification

inferred← citeshttps://doi.org/10.5381/jot.2015.14.3.a1openalex-snapshot

Formal Verification Techniques for Model Transformations: A Tridimensional Classification .

inferred← citeshttps://doi.org/10.5555/2050655.2050681openalex-snapshot

Semantic clone detection for model-based development of embedded systems

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.