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)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||© Springer-Verlag Berlin Heidelberg 2010. The original publication is available at www.springerlink.com.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||31 Mar 2011 10:55|
|Last Modified:||11 Jul 2011 14:34|
Actions (login required)