An algebraic framework for the transformation of attributed graphs
Term graph rewriting
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Graph Transformation Semantics for a QVT Language
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Solution for Model Checking Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A unified categorical approach for attributed graph rewriting
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Verification of graph grammars using a logical approach
Science of Computer Programming
| Hi-index | 0.02 |
Graphs are a very expressive formalism for system modeling, especially when attributes are allowed. Our research is mainly focused on the use of graphs for system verification. Up to now, there are two main different approaches of modeling (typed) attributed graphs and specifying their transformation. Here we report preliminary results of our investigation on a third approach. In our approach we couple a graph to a data signature that consists of unary operations only. Therefore, we transform arbitrary signatures into a structure comparable to what is called a graph structure signature in the literature, and arbitrary algebras into the corresponding algebra graph.