Research

An algebraic foundation for higraphs


Reference:

Power, J. and 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. Berlin: Springer, pp. 145-159. (Lecture Notes in Computer Science)

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.1007/3-540-44802-0_11

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.

Details

Item Type Book Sections
CreatorsPower, J.and Tourlas, K.
DOI10.1007/3-540-44802-0_11
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code5612
Additional InformationParis, 2001

Export

Actions (login required)

View Item