%B Trustworthly Global Computing (TCG 2010)
%O ? Springer-Verlag Berlin Heidelberg 2010. The final publication is available at www.springerlink.com.
%E Martin Wirsing
%E Martin Hofmann
%E Axel Rauschmayer
%I Springer
%X We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.

%P 205-221
%T An Algebra of Hierarchical Graphs
%V 6084
%A Roberto Bruni
%A Fabio Gadducci
%A Alberto Lluch-Lafuente
%L eprints144
%S Lecture Notes in Computer Science
%R 10.1007/978-3-642-15640-3_14
%D 2010