Towards Attributed Graphs in Groove | Zendy

Harmen Kastenberg | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Towards Attributed Graphs in Groove

Author(s) -

Harmen Kastenberg

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.03.030

Subject(s) - unary operation , graph rewriting , computer science , graph product , theoretical computer science , formalism (music) , graph , signature (topology) , graph property , mathematics , discrete mathematics , line graph , 1 planar graph , voltage graph , geometry , art , musical , visual arts

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research