relation: http://eprints.imtlucca.it/142/
title: On GS-Monoidal Theories for Graphs with Nesting
creator: Bruni, Roberto
creator: Corradini, Andrea
creator: Gadducci, Fabio
creator: Lluch-Lafuente, Alberto
creator: Montanari, Ugo
subject: QA75 Electronic computers. Computer science
description: 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.  
publisher: Springer
contributor: Engels, Gregor
contributor: Lewerentz, Claus
contributor: Schäfer, Wilhelm
contributor: Schürr, Andy
contributor: Westfechtel, Bernhard
date: 2010
type: Book Section
type: PeerReviewed
identifier:   Bruni, Roberto and Corradini, Andrea and Gadducci, Fabio and Lluch-Lafuente, Alberto and Montanari, Ugo  On GS-Monoidal Theories for Graphs with Nesting.   In:  Graph Transformations and Model-Driven Engineering.   Lecture Notes in Computer Science, 5765 .  Springer, pp. 59-86.  ISBN 978-3-642-17321-9      (2010)  
relation: http://dx.doi.org/10.1007/978-3-642-17322-6_4
relation: 10.1007/978-3-642-17322-6_4