On the public citation graph
Graph Transformations
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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-45832-8_4openalex-snapshot
Approximating the Behaviour of Graph Transformation Systems
inferredcites →https://doi.org/10.1007/978-0-387-35608-2_36openalex-snapshot
Model Checking Birth and Death
inferredcites →https://doi.org/10.1007/978-3-540-25959-6_40openalex-snapshot
The GROOVE Simulator: A Tool for State Space Generation
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_6openalex-snapshot
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
inferredcites →https://doi.org/10.1007/978-3-540-45221-8_8openalex-snapshot
CheckVML: A Tool for Model Checking Visual Modeling Languages
inferredcites →https://doi.org/10.1007/bfb0053588openalex-snapshot
Compositional verification of reactive systems specified by graph transformation
inferredcites →https://doi.org/10.1007/s10270-003-0050-xopenalex-snapshot
Automated formal verification of visual modeling languages by model checking
inferredcites →https://doi.org/10.1016/s1571-0661(04)80941-1openalex-snapshot
Towards Common Exchange Formats for Graphs and Graph Transformation Systems
inferredcites →https://doi.org/10.1142/4180openalex-snapshot
Handbook of Graph Grammars and Computing by Graph Transformation
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-33461-3_9openalex-snapshot
Hans-Jörg Kreowski, Renate Klempien-Hinrichs, Sabine Kuske
inferred← citeshttps://doi.org/10.1007/s00500-021-06476-9openalex-snapshot
Using Bayesian optimization algorithm for model-based integration testing
inferred← citeshttps://doi.org/10.1007/s10515-024-00417-0openalex-snapshot
Using data mining techniques to generate test cases from graph transformation systems specifications
inferred← citeshttps://doi.org/10.1007/s10515-026-00610-3openalex-snapshot
MoTDeReL: Model-based testing through deep reinforcement learning for software systems specified through graph transformation
inferred← citeshttps://doi.org/10.1007/s11704-012-1307-8openalex-snapshot
A graph-based generic type system for object-oriented programs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.037openalex-snapshot
RCA-Seq: An original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.075openalex-snapshot
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100564openalex-snapshot
Constructing optimized constraint-preserving application conditions for model transformation rules
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100893openalex-snapshot
Fundamentals of compositional rewriting theory
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.09.009openalex-snapshot
Symbolic graphs for attributed graph constraints
inferred← citeshttps://doi.org/10.1016/j.scico.2017.08.006openalex-snapshot
Translating essential OCL invariants to nested graph constraints for generating instances of meta-models
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102302openalex-snapshot
Reconfigurable GSPNs: A modeling formalism of evolvable discrete-event systems
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.1093/bioinformatics/btx481openalex-snapshot
Predicting novel metabolic pathways through subgraph mining
inferred← citeshttps://doi.org/10.1109/coginfocom.2014.7020515openalex-snapshot
Fundamentals of a graph transformation based web data processing system
inferred← citeshttps://doi.org/10.1109/edis.2017.8284048openalex-snapshot
Multi-objective optimization and formal specification of reconfigurable manufacturing system using adaptive NSGA-II
inferred← citeshttps://doi.org/10.1109/mathit.2017.8259733openalex-snapshot
Reconfigurable stochastic Petri nets: A new formalism for reconfigurable discrete event systems
inferred← citeshttps://doi.org/10.1109/tase.2014.22openalex-snapshot
An Approach to Modelling and Evaluating AGG Based Reliable Software Systems
inferred← citeshttps://doi.org/10.1109/tro.2008.918049openalex-snapshot
Toward a Unified Bayesian Approach to Hybrid Metric--Topological SLAM
inferred← citeshttps://doi.org/10.1109/tsmc.2018.2855209openalex-snapshot
On Methodology for the Verification of Reconfigurable Timed Net Condition/Event Systems
inferred← citeshttps://doi.org/10.1142/s0218126608004794openalex-snapshot
IMPROVED NET REWRITING SYSTEMS–EXTENDED PETRI NETS SUPPORTING DYNAMIC CHANGES
inferred← citeshttps://doi.org/10.1631/jzus.a0820415openalex-snapshot
Towards automated software model checking using graph transformation systems and Bogor
inferred← citeshttps://doi.org/10.22630/mgv.2018.27.1.1openalex-snapshot
Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.3233/ifs-162127openalex-snapshot
A greedy algorithm versus metaheuristic solutions to deadlock detection in Graph Transformation Systems
inferred← citeshttps://doi.org/10.3390/a16020105openalex-snapshot
Union Models for Model Families: Efficient Reasoning over Space and Time
inferred← citeshttps://doi.org/10.4204/eptcs.56.3openalex-snapshot
Typed lambda-terms in categorical attributed graph transformation
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.