Abstract
We develop an algebraic foundation for some of the graph-based structures underlying a variety of popular diagrammatic notations for the specification, modelling and programming of computing systems. Using hypergraphs and higraphs as leading examples, a locally ordered category Graph(C) of graphs in a locally ordered category C is defined and endowed with symmetric monoidal closed structure. Two other operations on higraphs and variants, selected for relevance to computing applications, are generalised in this setting.
| Original language | English |
|---|---|
| Pages (from-to) | 346-357 |
| Number of pages | 12 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 45 |
| DOIs | |
| Publication status | Published - 2001 |
Fingerprint
Dive into the research topics of 'An Algebraic Foundation for Graph-based Diagrams in Computing'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS