TY - CHAP
T1 - An algebraic foundation for higraphs
AU - Power, John
AU - Tourlas, Konstantinos
N1 - Paris, 2001
PY - 2001
Y1 - 2001
N2 - Higraphs, which are structures extending graphs by permitting a hierarchy of nodes, underlie a number of diagrammatic formalisms popular in computing. We provide an algebraic account of higraphs (and of a mild extension), with our main focus being on the mathematical structures underlying common operations, such as those required for understanding the semantics of higraphs and Statecharts, and for implementing sound software tools which support them.
AB - Higraphs, which are structures extending graphs by permitting a hierarchy of nodes, underlie a number of diagrammatic formalisms popular in computing. We provide an algebraic account of higraphs (and of a mild extension), with our main focus being on the mathematical structures underlying common operations, such as those required for understanding the semantics of higraphs and Statecharts, and for implementing sound software tools which support them.
UR - http://dx.doi.org/10.1007/3-540-44802-0_11
U2 - 10.1007/3-540-44802-0_11
DO - 10.1007/3-540-44802-0_11
M3 - Chapter or section
VL - 2142
T3 - Lecture Notes in Computer Science
SP - 145
EP - 159
BT - Computer Science Logic 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings
PB - Springer
CY - Berlin
ER -