%D 2010
%S Lecture Notes in Computer Science
%R 10.1007/978-3-642-17322-6_4
%O ? Springer-Verlag Berlin Heidelberg 2010. The original publication is available at www.springerlink.com.
%V 5765
%E Gregor Engels
%E Claus Lewerentz
%E Wilhelm Sch?fer
%E Andy Sch?rr
%E Bernhard Westfechtel
%T On GS-Monoidal Theories for Graphs with Nesting
%I Springer
%P 59-86
%A Roberto Bruni
%A Andrea Corradini
%A Fabio Gadducci
%A Alberto Lluch-Lafuente
%A Ugo Montanari
%L eprints142
%X We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally or globally restricted nodes. Such graphs allow to represent explicitly and at the right level of abstraction some relevant topological and logical features of models and systems, including nesting, hierarchies, sharing of resources, and pointers or links. We also provide an encoding of the proposed algebra into terms of a gs-monoidal theory, and through these into a suitable class of  wellscoped  term graphs, showing that this encoding is sound and complete with respect to the axioms of the algebra.

%B Graph Transformations and Model-Driven Engineering