Abstract
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.
Original language | English |
---|---|
Title of host publication | Trustworthly Global Computing : 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers |
Publisher | Springer Berlin Heidelberg |
Publication date | 2010 |
Pages | 205-221 |
ISBN (Print) | 978-3-642-15639-7 |
ISBN (Electronic) | 978-3-642-15640-3 |
DOIs | |
Publication status | Published - 2010 |
Externally published | Yes |
Event | 5th Symposium on Trustworthy Global Computing - Munich, Germany Duration: 24 Feb 2010 → 26 Feb 2010 Conference number: 5 |
Conference
Conference | 5th Symposium on Trustworthy Global Computing |
---|---|
Number | 5 |
Country/Territory | Germany |
City | Munich |
Period | 24/02/2010 → 26/02/2010 |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 6084 |
ISSN | 0302-9743 |