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 well-scoped term graphs, showing that this encoding is sound and complete with respect to the axioms of the algebra.

On gs-monoidal theories for graphs with nesting

BRUNI, ROBERTO;CORRADINI, ANDREA;GADDUCCI, FABIO;MONTANARI, UGO GIOVANNI ERASMO
2010-01-01

Abstract

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 well-scoped term graphs, showing that this encoding is sound and complete with respect to the axioms of the algebra.
2010
Bruni, Roberto; Corradini, Andrea; Gadducci, Fabio; LLUCH LAFUENTE, A; Montanari, UGO GIOVANNI ERASMO
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/137287
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact