An algebraic foundation for higraphs

John Power, Konstantinos Tourlas

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationComputer Science Logic 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings
Place of PublicationBerlin
PublisherSpringer
Pages145-159
Number of pages15
Volume2142
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Fingerprint Dive into the research topics of 'An algebraic foundation for higraphs'. Together they form a unique fingerprint.

  • Cite this

    Power, J., & Tourlas, K. (2001). An algebraic foundation for higraphs. In Computer Science Logic 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings (Vol. 2142, pp. 145-159). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/3-540-44802-0_11