Abstract
Hierarchically distributed graph transformation offers means to model different aspects of open distributed systems very intuitively in a graphical way. The distribution topology as well as local object structures are represented graphically. Distributed actions such as local actions, network activities, communication and synchronization can be described homogeneously using the same method: graph transformation. This new approach to graph transformation follows the lines of algebraic and categorical graph grammars and fits into the framework of double-pushout high-level replacement systems.
Author supplied keywords
Cite
CITATION STYLE
Taentzer, G. (1996). Hierarchically distributed graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 304–320). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_95
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
