An Algebraic Foundation for Graph-based Diagrams in Computing
Reference:
Power, J. and Tourlas, K., 2001. An Algebraic Foundation for Graph-based Diagrams in Computing. Electronic Notes in Theoretical Computer Science, 45, pp. 346-357.
Related documents:
This repository does not currently have the full-text of this item.You may be able to access a copy if URLs are provided below.
Official URL:
http://dx.doi.org/10.1016/S1571-0661(04)80971-X
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.
Details
| Item Type | Articles |
| Creators | Power, J.and Tourlas, K. |
| DOI | 10.1016/S1571-0661(04)80971-X |
| Departments | Faculty of Science > Computer Science |
| Refereed | Yes |
| Status | Published |
| ID Code | 26492 |
Export
Actions (login required)
| View Item |
