We dene an algebraic theory of hierarchical graphs, whose equational part characterises graph isomorphism, i.e. it is formed by a sound and complete set of axioms equating two terms whenever they ...

We dene an algebraic theory of hierarchical graphs, whose equational part characterises graph isomorphism, i.e. it is formed by a sound and complete set of axioms equating two terms whenever they represent the same hierarchical graph. Our algebra can thus be understood as a high-level language for describing graphs with a nested structure,

and is then particularly suited for the visual specication of process calculi with inherently hierarchical features such as sessions, transactions or locations. We illustrate our approach by encoding CaSPiS, a recently

proposed session-centered calculus.

### Statistics

### Views

- Total Views
- 3,567
- Views on SlideShare
- 3,542
- Embed Views

### Actions

- Likes
- 3
- Downloads
- 30
- Comments
- 0

http://www.slideshare.net | 20 |

http://www.linkedin.com | 3 |

https://www.linkedin.com | 2 |

Full NameComment goes here.Samuel Won2 years agoChris Seeling, Engineer at RMIT 4 years agoJonathan Boutelle, Director of Technology at SlideShare 5 years ago