On A Graph Formalism for Ordered Edges
Mol de, Maarten 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.
Restricted to UT campus only: Request a copy
|Abstract:||Though graphs are ﬂexible 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 deﬁne how lists can be manipulated. We show that the resulting category satisﬁes sufﬁcient 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 beneﬁt of a smaller, more appropriate model and more straightforward manipulation.
|Item Type:||Conference or Workshop Item|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/72603|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page