On the public citation graph

Categorical principles, techniques and results for high-level-replacement systems in computer science

https://doi.org/10.1007/bf00872984
0 signed · 50 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-08442-8_94openalex-snapshot
Transformations of Derivation Sequences in Graph Grammars
inferredcites →https://doi.org/10.1007/3-540-18771-5_72openalex-snapshot
Graph rewriting with unification and composition
inferredcites →https://doi.org/10.1007/3-540-53982-4_6openalex-snapshot
Algebraic graph rewriting using a single pushout
inferredcites →https://doi.org/10.1007/3-540-57787-4_7openalex-snapshot
Note on standard representation of graphs and graph derivations
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-642-61284-8openalex-snapshot
Fundamentals of Algebraic Specification 2
inferredcites →https://doi.org/10.1007/978-3-642-61284-8_4openalex-snapshot
Basic Operations on Module Specifications
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1007/bfb0017395openalex-snapshot
From graph grammars to high level replacement systems
inferredcites →https://doi.org/10.1007/bfb0017408openalex-snapshot
Graph rewriting in some categories of partial morphisms
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0035788openalex-snapshot
Modular system design applying graph grammars techniques
inferredcites →https://doi.org/10.1016/0022-0000(87)90030-4openalex-snapshot
Amalgamation of graph transformations: A synchronization mechanism
inferredcites →https://doi.org/10.1016/0304-3975(80)90016-xopenalex-snapshot
Parallelism and concurrency of graph manipulations
inferredcites →https://doi.org/10.1016/0304-3975(84)90021-5openalex-snapshot
On graph rewritings
inferredcites →https://doi.org/10.1016/0304-3975(87)90079-xopenalex-snapshot
On “on graph rewritings”
inferredcites →https://doi.org/10.1016/0304-3975(90)90171-dopenalex-snapshot
Pushout-complements and basic concepts of grammars in toposes
inferredcites →https://doi.org/10.1016/0304-3975(93)90066-3openalex-snapshot
Parallel and distributed derivations in the single-pushout approach
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.2307/2325048openalex-snapshot
Abstract and Concrete Categories.
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/11841883_4openalex-snapshot
Sesqui-Pushout Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_12openalex-snapshot
Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_15openalex-snapshot
Abstraction and Control for Shapely Nested Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_30openalex-snapshot
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_16openalex-snapshot
Abstract Petri Nets as a Uniform Approach to High-Level Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_15openalex-snapshot
Single pushout transformations of equationally defined graph structures with applications to actor systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_210openalex-snapshot
On the expressive power of algebraic graph grammars with application conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_15openalex-snapshot
Redundancy and Subsumption in High-Level Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_31openalex-snapshot
Tutorial Introduction to Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_17openalex-snapshot
Hereditary Pushouts Reconsidered
inferred← citeshttps://doi.org/10.1016/j.ins.2004.03.019openalex-snapshot
The uniqueness condition for the double pushout transformation of algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.002openalex-snapshot
Single pushout rewriting in comprehensive systems of graph-like structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00139-9openalex-snapshot
Algebraic transformation of unary partial algebras I. double-pushout approach
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00282-xopenalex-snapshot
Algebraic transformation of unary partial algebras II: Single-pushout approach
inferred← citeshttps://doi.org/10.1017/s0960129598002576openalex-snapshot
A theory of mixin modules: basic and derived operators
inferred← citeshttps://doi.org/10.1023/a:1008683005045openalex-snapshot
Distributed Graphs and Graph Transformation
inferred← citeshttps://doi.org/10.1023/a:1008695316594openalex-snapshot
Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems
inferred← citeshttps://doi.org/10.1023/a:1008734426504openalex-snapshot
Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems
inferred← citeshttps://doi.org/10.14279/depositonce-1420openalex-snapshot
Formal Specification and Rule-Based Refinement of Software Components
inferred← citeshttps://doi.org/10.1515/dema-1997-0116openalex-snapshot
A NOTE ON A SERIES OF PAPERS BY BURMEISTER AND WOJDYtO
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4b.129openalex-snapshot
Projektowanie wizualne z wykorzystaniem hierarchicznych hipergrafów
inferred← citeshttps://doi.org/10.3233/fi-1996-263404openalex-snapshot
GRAPH GRAMMARS WITH NEGATIVE APPLICATION CONDITIONS
inferred← citeshttps://doi.org/10.3233/fi-1997-30206openalex-snapshot
Double-pushout hypergraph rewriting using total conformisms
inferred← citeshttps://doi.org/10.3233/fi-2012-704openalex-snapshot
Adhesivity with Partial Maps instead of Spans
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.