On the public citation graph

Graph-Grammars and Their Application to Computer Science and Biology

https://doi.org/10.1007/bfb0025713
0 signed · 209 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w8260openalex-snapshot
Graphical Symbol Recognition
inferred← citeshttps://doi.org/10.1002/scj.4690220701openalex-snapshot
Logic hypergraph grammars and context‐free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/11494744_16openalex-snapshot
High-Level Nets with Nets and Rules as Tokens
inferred← citeshttps://doi.org/10.1007/11601548_16openalex-snapshot
Confluence of Graph Transformation Revisited
inferred← citeshttps://doi.org/10.1007/11780274_13openalex-snapshot
Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
inferred← citeshttps://doi.org/10.1007/11841883_9openalex-snapshot
Molecular Analysis of Metabolic Pathway with Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_22openalex-snapshot
A comparison between petri-nets and graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_5openalex-snapshot
Graph rewriting and automatic, machine-independent program optimization
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_16openalex-snapshot
Generating graph languages using hypergraph grammars
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_107openalex-snapshot
On the constructive description of graph languages accepted by finite automata
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_5openalex-snapshot
A survey of NLC grammars
inferred← citeshttps://doi.org/10.1007/3-540-13878-1_7openalex-snapshot
The use of Diana in compilers, language transformers, formatters, and debuggers
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_17openalex-snapshot
Amalgamation of graph transformations with applications to synchronization
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_18openalex-snapshot
Decompilation of control structures by means of graph transformations
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_47openalex-snapshot
Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_6openalex-snapshot
Combinatorial hypermap rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_48openalex-snapshot
On partially ordered graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_62openalex-snapshot
Practical applications of precedence graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_63openalex-snapshot
Is parallelism already concurrency? Part 1: Derivations in graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_65openalex-snapshot
Map OL-systems with edge label control: Comparison of marker and cyclic systems
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_66openalex-snapshot
From 0L and 1L map systems to indeterminate and determinate growth in plant morphogenesis
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_67openalex-snapshot
Fundamentals of edge-label controlled graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_71openalex-snapshot
Map 0L systems with markers
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_72openalex-snapshot
Graph rewriting with unification and composition
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_73openalex-snapshot
Complexity of pattern generation via planar parallel binary fission/fusion grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_75openalex-snapshot
Advances in array languages
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_13openalex-snapshot
Garp: Graph abstractions for concurrent programming
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_15openalex-snapshot
Computational Completeness of Programming Languages Based on Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45397-0_9openalex-snapshot
On Formalizing UML with High-Level Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_12openalex-snapshot
Relabelling in Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_14openalex-snapshot
Confluence of Typed Attributed Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_17openalex-snapshot
Distributed Graph Transformation Units
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_22openalex-snapshot
Formalising Behaviour Preserving Program Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_25openalex-snapshot
Rule Invariants in Graph Transformation Systems for Analyzing Safety-Critical Systems
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_3openalex-snapshot
Bigraphs as a Model for Mobile Interaction
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_10openalex-snapshot
A parser for context free plex grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_16openalex-snapshot
Logic programming as hypergraph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_6openalex-snapshot
Algebraic graph rewriting using a single pushout
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_12openalex-snapshot
A programming language for deriving hypergraphs
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_29openalex-snapshot
A maximum path length pumping lemma for edge-replacement languages
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_14openalex-snapshot
Relational structures and their partial morphisms in view of single pushout rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_22openalex-snapshot
Logic based structure rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_47openalex-snapshot
Exponential time analysis of confluent and boundary eNCE graph languages
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_68openalex-snapshot
On termination of graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_78openalex-snapshot
Issues in the practical use of graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_81openalex-snapshot
On the interleaving semantics of transformation units — A step into GRACE
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_69openalex-snapshot
Concurrent graph and term graph rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-36709-0_15openalex-snapshot
A Living Monograph for Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_36openalex-snapshot
Metric-Driven Grammars and Morphogenesis (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_14openalex-snapshot
Canonical Derivations with Negative Application Conditions
inferred← citeshttps://doi.org/10.1007/978-3-319-11587-0_16openalex-snapshot
Algebraic Graph Transformations for Merging Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-319-11653-2_29openalex-snapshot
Resolution of Interfering Product Fragments in Software Product Line Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_1openalex-snapshot
Composition of Graph-Transformation-Based DSL Definitions by Amalgamation
inferred← citeshttps://doi.org/10.1007/978-3-319-33921-4_15openalex-snapshot
Modeling DNA Nanodevices Using Graph Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_12openalex-snapshot
Adhesive High-Level Replacement Categories and Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_13openalex-snapshot
Fundamental Theory for Typed Attributed Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_14openalex-snapshot
Parallel Independence in Hierarchical Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_21openalex-snapshot
Constraints and Application Conditions: From Graphs to High-Level Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_27openalex-snapshot
Translating Java Code to Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_20openalex-snapshot
Embeddings and Contexts for Link Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_6openalex-snapshot
Graph Transformation with Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_8openalex-snapshot
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_20openalex-snapshot
Hypergraphs as a Uniform Diagram Representation Model
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_23openalex-snapshot
More About Control Conditions for Transformation Units
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_25openalex-snapshot
A Framework for Adding Packages to Graph Transformation Approaches
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_8openalex-snapshot
Double-Pushout Approach with Injective Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_9openalex-snapshot
Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_7openalex-snapshot
Transformations in Reconfigurable Place/Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_9openalex-snapshot
Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_39openalex-snapshot
A Unified Categorical Approach for Attributed Graph Rewriting
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_27openalex-snapshot
A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-01284-6_15openalex-snapshot
Generative Network Automata: A Generalized Framework for Modeling Adaptive Network Dynamics Using Graph Rewritings
inferred← citeshttps://doi.org/10.1007/978-3-642-17322-6_4openalex-snapshot
On GS-Monoidal Theories for Graphs with Nesting
inferred← citeshttps://doi.org/10.1007/978-3-642-28038-2_12openalex-snapshot
Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-28412-0_11openalex-snapshot
An Institution for Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-30835-2_2openalex-snapshot
Modelling of Communication Platforms Using Algebraic High-Level Nets and Their Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-30982-3_10openalex-snapshot
An Introduction to Model Versioning
inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_8openalex-snapshot
Specification Patterns for Properties over Reachable States of Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_13openalex-snapshot
A General Attribution Concept for Models in ${\cal M}$ -Adhesive Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_15openalex-snapshot
$\mathcal M, \mathcal N$ -Adhesive Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_2openalex-snapshot
Behaviour Protection in Modular Rule-Based System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_8openalex-snapshot
Transformation Systems with Incremental Negative Application Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-39614-4_7openalex-snapshot
Compositional Development of BPMN
inferred← citeshttps://doi.org/10.1007/978-3-642-39787-5_6openalex-snapshot
Consistent Ontologies Evolution Using Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_18openalex-snapshot
From Parallel Graph Grammars to Parallel High-Level Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-69032-7_2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-69419-6_4openalex-snapshot
On a Specification and Performance Evaluation Model for Multicomputer Database Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-77281-8_24openalex-snapshot
Syntactic Analysis of Context—Free Plex Languages for Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-77449-2_3openalex-snapshot
From Parallel to Distributed Derivations of Graphs in the Single-Pushout-Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-83462-2_5openalex-snapshot
Computing the Minimum Error Distance of Graphs in 0(n3) Time with Precedence Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_1openalex-snapshot
Investigations Into Drosophila Wing Development—Results from a Lindenmayer Model
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_18openalex-snapshot
Rule Trees Represent Derivations in Edge Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_24openalex-snapshot
A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_26openalex-snapshot
Some Systems for Map Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_3openalex-snapshot
Planar Map Generation by Parallel Binary Fission/Fusion Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_35openalex-snapshot
Array Languages and Lindenmayer Systems —A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_7openalex-snapshot
Graph Grammars with Application Conditions
inferred← citeshttps://doi.org/10.1007/978-3-658-32330-1_4openalex-snapshot
Graphgrammatiken – Verarbeiten von Konzepten und Beziehungen
inferred← citeshttps://doi.org/10.1007/978-3-7091-8596-4_7openalex-snapshot
Application of Graph Rewriting to Optimization and Parallelization of Programs
inferred← citeshttps://doi.org/10.1007/978-94-009-4464-0_2openalex-snapshot
Syntactics. Its Relation To Morphology and Syntax, To Semantics and Pragmatics, and To Syntagmatics and Paradigmatics
inferred← citeshttps://doi.org/10.1007/b106390openalex-snapshot
Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday
inferred← citeshttps://doi.org/10.1007/b106657_1openalex-snapshot
Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees
inferred← citeshttps://doi.org/10.1007/bf00200816openalex-snapshot
A language to describe the growth of neurites
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bf00289591openalex-snapshot
A characterization of context-free string languages by directed node-label controlled graph grammars
inferred← citeshttps://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferred← citeshttps://doi.org/10.1007/bf02251236openalex-snapshot
Software specification using graph grammars
inferred← citeshttps://doi.org/10.1007/bf03036461openalex-snapshot
A kernel language for programmed rewriting of (hyper)graphs
inferred← citeshttps://doi.org/10.1007/bfb0000098openalex-snapshot
Algorithms for the generation and drawing of maps representing cell clones
inferred← citeshttps://doi.org/10.1007/bfb0000100openalex-snapshot
Church-Rosser properties for graph replacement systems with unique splitting
inferred← citeshttps://doi.org/10.1007/bfb0000101openalex-snapshot
Specification of data bases through rewriting rules
inferred← citeshttps://doi.org/10.1007/bfb0000104openalex-snapshot
On context-free graph languages generated by edge replacement
inferred← citeshttps://doi.org/10.1007/bfb0000107openalex-snapshot
Graph grammars with node-label controlled rewriting and embedding
inferred← citeshttps://doi.org/10.1007/bfb0000111openalex-snapshot
A graph-relational approach to geographic databases
inferred← citeshttps://doi.org/10.1007/bfb0000113openalex-snapshot
Software specification by graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0000115openalex-snapshot
Transformation of structures by convex homomorphisms
inferred← citeshttps://doi.org/10.1007/bfb0000118openalex-snapshot
Tree-graph grammars for pattern recognition
inferred← citeshttps://doi.org/10.1007/bfb0000119openalex-snapshot
The isomorphism problem is polynomially solvable for certain graph languages
inferred← citeshttps://doi.org/10.1007/bfb0000121openalex-snapshot
Two-level expression representation for faster evaluation
inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot
An algebra of graphs and graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0017142openalex-snapshot
Automata and rational expressions on planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0017383openalex-snapshot
Programming with very large graphs
inferred← citeshttps://doi.org/10.1007/bfb0017389openalex-snapshot
An efficient implementation of graph grammars based on the RETE matching algorithm
inferred← citeshttps://doi.org/10.1007/bfb0017391openalex-snapshot
Graphic equivalence and computer optimization
inferred← citeshttps://doi.org/10.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferred← citeshttps://doi.org/10.1007/bfb0017400openalex-snapshot
Physically-based graphical interpretation of marker cellwork L-systems
inferred← citeshttps://doi.org/10.1007/bfb0017411openalex-snapshot
Recognizing rooted context-free flowgraph languages in polynomial time
inferred← citeshttps://doi.org/10.1007/bfb0017421openalex-snapshot
Recognizing edge replacement graph languages in cubic time
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0022515openalex-snapshot
Node-label controlled graph grammars (Extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0036472openalex-snapshot
The computational complexity of certain graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/s10485-007-9106-3openalex-snapshot
Construction and Properties of Adhesive and Weak Adhesive High-Level Replacement Categories
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90080-6openalex-snapshot
Representing graph families with edge grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90012-2openalex-snapshot
Handle NLC grammars and R. E. languages
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90030-4openalex-snapshot
Amalgamation of graph transformations: A synchronization mechanism
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90012-aopenalex-snapshot
Edge-label controlled graph grammars
inferred← citeshttps://doi.org/10.1016/0022-5193(81)90302-7openalex-snapshot
Models for growth of clones in hexagonal cell arrangements: Applications in Drosophila wing disc epithelia and plant epidermal tissues
inferred← citeshttps://doi.org/10.1016/0146-664x(82)90002-8openalex-snapshot
Cell division patterns: Syntactical description and implementation
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00084-zopenalex-snapshot
A graph grammar model for concurrent and distributed software specification-in-large
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90106-xopenalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90015-6openalex-snapshot
Circular expressions: elimination of static environments
inferred← citeshttps://doi.org/10.1016/0167-9236(93)90063-9openalex-snapshot
An integrated modeling environment based on attributed graphs and graph-grammars
inferred← citeshttps://doi.org/10.1016/0167-9236(93)e0031-8openalex-snapshot
Developments in graph-based modeling for decision support
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90087-7openalex-snapshot
Determinism in parallel systems
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90135-xopenalex-snapshot
Restrictions on NLC graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90179-lopenalex-snapshot
Results on NLC grammars with one-letter terminal alphabets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90183-3openalex-snapshot
Hypermap rewriting: a combinatorial approach
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90066-3openalex-snapshot
Parallel and distributed derivations in the single-pushout approach
inferred← citeshttps://doi.org/10.1016/0306-4379(85)90004-3openalex-snapshot
A graph grammar approach to geographical databases
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90137-7openalex-snapshot
Conceptual graphs as a universal knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0771-1.50011-4openalex-snapshot
TOWARD THE EXPRESSIVE POWER OF NATURAL LANGUAGE
inferred← citeshttps://doi.org/10.1016/j.artint.2015.02.004openalex-snapshot
Modular robotic systems: Methods and algorithms for abstraction, planning, control, and synchronization
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.04.001openalex-snapshot
Graph grammars according to the type of input and manipulated data: A survey
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.12.036openalex-snapshot
Time and Space Issues in the Generation of Graph Transition Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.048openalex-snapshot
Object-Oriented Connector-Component Architectures
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.016openalex-snapshot
Transformations of Petri Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.01.014openalex-snapshot
Cloning and Expanding Graph Transformation Rules for Refactoring
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.002openalex-snapshot
Bigraphs and Their Algebra
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.043openalex-snapshot
Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.005openalex-snapshot
Specifying graph languages with type graphs
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100484openalex-snapshot
CoReS: A tool for computing core graphs via SAT/SMT solvers
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.03.012openalex-snapshot
An overview of the K semantic framework
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.09.007openalex-snapshot
How to delete categorically — Two pushout complement constructions
inferred← citeshttps://doi.org/10.1016/j.knosys.2014.10.007openalex-snapshot
Algebraic graph transformations for formalizing ontology changes and evolving ontologies
inferred← citeshttps://doi.org/10.1016/j.precisioneng.2016.12.005openalex-snapshot
Scale independent surface characterisation: Geography meets precision surface metrology
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102728openalex-snapshot
Topological consistency preservation with graph transformation schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.038openalex-snapshot
Adaptive star grammars and their languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.004openalex-snapshot
Graph grammars with string-regulated rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.027openalex-snapshot
Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00184-7openalex-snapshot
Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80196-3openalex-snapshot
Implementing β-Reduction by Hypergraph Rewriting
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1051/ita/1983170201631openalex-snapshot
Hypergraph systems and their extensions
inferred← citeshttps://doi.org/10.1080/10798587.1999.10750755openalex-snapshot
An Introduction to Graph-Rewriting Framework for High-Level Robotic Task Planning
inferred← citeshttps://doi.org/10.1088/2051-672x/ab70e8openalex-snapshot
Surfaces—topography and topology
inferred← citeshttps://doi.org/10.1088/2051-672x/abfdffopenalex-snapshot
A Morse theoretic approach to the geometrical feature terms specified in ISO 25178-2 and ISO 16610-85
inferred← citeshttps://doi.org/10.1093/jigpal/6.2.259openalex-snapshot
Relational treatment of term graphs with bound variables
inferred← citeshttps://doi.org/10.1109/32.7624openalex-snapshot
An integrated life-cycle model for software maintenance
inferred← citeshttps://doi.org/10.1109/hcc.2001.995230openalex-snapshot
Shapely hierarchical graph transformation
inferred← citeshttps://doi.org/10.1109/iiai-aai.2014.51openalex-snapshot
Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems
inferred← citeshttps://doi.org/10.1109/iros.2011.6094875openalex-snapshot
Self-assembly for maximum yields under constraints
inferred← citeshttps://doi.org/10.1109/iwssd.1996.501146openalex-snapshot
A mathematical toolbox for the software architect
inferred← citeshttps://doi.org/10.1109/tac.2015.2418673openalex-snapshot
Probabilistic Performance Guarantees for Distributed Self-Assembly
inferred← citeshttps://doi.org/10.1109/tpami.1983.4767372openalex-snapshot
Candide's Practical Principles of Experimental Pattern Recognition
inferred← citeshttps://doi.org/10.1109/tpami.1984.4767549openalex-snapshot
Two-Dimensional Critical Point Configuration Graphs
inferred← citeshttps://doi.org/10.1109/tpami.1986.4767800openalex-snapshot
A Step Towards Unification of Syntactic and Statistical Pattern Recognition
inferred← citeshttps://doi.org/10.1111/j.1438-8677.1983.tb03227.xopenalex-snapshot
Tissue Geometry and Ordered Cellular Behavior
inferred← citeshttps://doi.org/10.1142/s0219720005001077openalex-snapshot
HIDDEN MARKOV MODELS, GRAMMARS, AND BIOLOGY: A TUTORIAL
inferred← citeshttps://doi.org/10.1145/253228.253241openalex-snapshot
Introducing formal specification methods in industrial practice
inferred← citeshttps://doi.org/10.1145/3057857openalex-snapshot
Visual Simple Transformations
showing the first 200 of 209 · page through all 209
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.