On A Graph Formalism for Ordered Edges

Share/Save/Bookmark

Mol, Maarten de and Rensink, Arend (2010) On A Graph Formalism for Ordered Edges. In: Ninth International Workshop on Graph Transformation and Visual Modeling Techniques, GT-VMT 2010, 20-21 March 2010, Paphos, Cyprus.

[img] PDF
Restricted to UT campus only
: Request a copy
191kB
Abstract:Though graphs are flexible enough to model any kind of data structure in principle, for some structures this results in a rather large overhead. This is for instance true for lists, i.e., edges that are meant to point to an ordered collection of nodes. Such structures are frequently encountered, for instance as ordered associations in UML diagrams. Several options exist to model lists using standard graphs, but all of them need auxiliary structure, and even so their manipulation in graph transformation rules is not trivial.

In this paper we propose to enrich graphs with special ordered edges, which more naturally represent the intended structure, and define how lists can be manipulated. We show that the resulting category satisfies sufficient HLR properties to apply standard algebraic graph transformation. We believe that in a context where lists are common, the cost of a more complicated graph formalism is outweighed by the benefit of a smaller, more appropriate model and more straightforward manipulation.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/72603
Official URL:http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/417/379
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page