TY  - CHAP
ID  - eprints142
SP  - 59
M1  - 5765
SN  - 978-3-642-17321-9
AV  - none
A1  - Bruni, Roberto
A1  - Corradini, Andrea
A1  - Gadducci, Fabio
A1  - Lluch-Lafuente, Alberto
A1  - Montanari, Ugo
UR  - http://dx.doi.org/10.1007/978-3-642-17322-6_4
TI  - On GS-Monoidal Theories for Graphs with Nesting
N1  - © Springer-Verlag Berlin Heidelberg 2010. The original publication is available at www.springerlink.com.
Y1  - 2010///
N2  - 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.

T3  - Lecture Notes in Computer Science
ED  - Engels, Gregor
ED  - Lewerentz, Claus
ED  - Schäfer, Wilhelm
ED  - Schürr, Andy
ED  - Westfechtel, Bernhard
T2  - Graph Transformations and Model-Driven Engineering
PB  - Springer
EP  - 86
ER  -