An Algebra of Hierarchical Graphs and its Application to Structural Encoding

• Main Authors: R. Bruni, F. Gadducci, A. Lluch Lafuente
• Format: Article
• Language: English
• Published: Alexandru Ioan Cuza University of Iasi 2010-12-01
• Series: Scientific Annals of Computer Science
• Online Access: http://www.info.uaic.ro/bin/download/Annals/XX/XX_2.pdf

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. In particular, we propose the use of our graph formalism as a convenient way to describe configurations in process calculi equipped with inherently hierarchical features such as sessions, locations, transactions, membranes or ambients. The graph syntax can be seen as an intermediate representation language, that facilitates the encodings of algebraic specifications, since it provides primitives for nesting, name restriction and parallel composition. In addition, proving soundness and correctness of an encoding (i.e. proving that structurally equivalent processes are mapped to isomorphic graphs) becomes easier as it can be done by induction over the graph syntax.