TY - JOUR

T1 - An Algebraic Foundation for Graph-based Diagrams in Computing

AU - Power, John

AU - Tourlas, K

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1016/S1571-0661(04)80971-X

U2 - 10.1016/S1571-0661(04)80971-X

DO - 10.1016/S1571-0661(04)80971-X

M3 - Article

SN - 1571-0661

VL - 45

SP - 346

EP - 357

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

ER -