On the public citation graph

An algebra of graphs and graph rewriting

https://doi.org/10.1007/bfb0013469
0 signed · 32 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.1007/3-540-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/3-540-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-18771-5_72openalex-snapshot
Graph rewriting with unification and composition
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0017372openalex-snapshot
Graph Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferredcites →https://doi.org/10.1007/bfb0017395openalex-snapshot
From graph grammars to high level replacement systems
inferredcites →https://doi.org/10.1007/bfb0017403openalex-snapshot
Collage grammars
inferredcites →https://doi.org/10.1007/bfb0017408openalex-snapshot
Graph rewriting in some categories of partial morphisms
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.1007/bfb0039072openalex-snapshot
Rewriting as a unified model of concurrency
inferredcites →https://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot
Petri nets are monoids
inferredcites →https://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferredcites →https://doi.org/10.1109/icse.1990.63624openalex-snapshot
A rule-based approach to modular system design
inferredcites →https://doi.org/10.1109/lics.1988.5114openalex-snapshot
Petri nets are monoids: a new algebraic foundation for net theory
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.5555/100296.100324openalex-snapshot
A rule-based approach to modular system design

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_19openalex-snapshot
Deriving Bisimulation Congruences for Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_21openalex-snapshot
On relating rewriting systems and graph grammars to event structures
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_2openalex-snapshot
Ugo Montanari and Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_17openalex-snapshot
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-00593-0_2openalex-snapshot
Rewriting Logic Semantics and Verification of Model Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90087-vopenalex-snapshot
An algebraic semantics for structured transition systems and its application to logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90206-2openalex-snapshot
An abstract machine for concurrent modular systems: CHARM
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.040openalex-snapshot
From Chemical Rules to Term Rewriting
inferred← citeshttps://doi.org/10.48456/tr-496openalex-snapshot
Contexts and embeddings for closed shallow action graphs
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.