Towards Attributed Graphs in Groove

Harmen Kastenberg

Research output: Contribution to journalConference articleAcademicpeer-review

9 Citations (Scopus)
26 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)47-54
Number of pages8
JournalElectronic notes in theoretical computer science
Volume154
Issue number2
DOIs
Publication statusPublished - May 2006
EventWorkshop on Graph Transformation for Verification and Concurrency, GT-VC 2005 - San Francisco, United States
Duration: 22 Aug 200522 Aug 2005

Keywords

  • Signature structure
  • Graph transformation
  • Attributed graphs
  • Algebra graph

Fingerprint Dive into the research topics of 'Towards Attributed Graphs in Groove'. Together they form a unique fingerprint.

  • Cite this