Realizing graph transformations by pre- And postconditions and command sequences

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies two realizations of graph transformations which are based on a UML class diagram. The first realization achieves a representation in terms of descriptive pre- and postconditions. The second one yields an operationally executable command sequence in terms of basic commands for object and link creation, attribute modification, and object and link destruction. Our aim for realizing graph transformations in terms of target languages offering different views, i.e., descriptive or operational, is to take advantage of both views and to utilize the benefits which both views provide. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Büttner, F., & Gogolla, M. (2006). Realizing graph transformations by pre- And postconditions and command sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4178 LNCS, pp. 398–413). Springer Verlag. https://doi.org/10.1007/11841883_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free