Compositionality in graph transformation
DOI10.1007/978-3-642-14162-1_26zbMATH Open1288.68144OpenAlexW1930108061MaRDI QIDQ3587448FDOQ3587448
Authors: Arend Rensink 
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_26
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- Variability-based model transformation: formal foundation and application
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Diagrammatic Representation and Inference
- Rule composition in graph transformation models of chemical reactions
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Transformation of typed composite graphs with inheritance and containment structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositional analysis of probabilistic timed graph transformation systems
- Graph Transformation by Computational Category Theory
- Compositional analysis of probabilistic timed graph transformation systems
- Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
- Generalised compositionality in graph transformation
- Transformations on channel graphs
This page was built for publication: Compositionality in graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587448)
