This paper deals with model transformation based on attributed graph
rewriting. Our contribution investigates a single pushout approach for applying
the rewrite rules. The computation of graph attributes is obtained through the
use of typed lambda-calculus with inductive types. In this paper we present
solutions to cope with single pushout construction for the graph structure and
the computations functions. As this rewrite system uses inductive types, the
expressiveness of attribute computations is facilitated and appears more
efficient than the one based on Sigma-algebras. Some examples showing the
interest of our computation approach are described in this paper.Comment: In Proceedings AMMSE 2011, arXiv:1106.596
Abstract. In this paper, we give a new formalism for attributed graph rewrites resting on category theory and type theory. Our main goal is to offer a single theoretical foundation that embeds the rewrite of structural parts of graphs and attribute computations which has more expressive power for attribute computations as well.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.