Jump to content

Higraph

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BD2412 (talk | contribs) at 20:21, 31 January 2016 (Fixing links to disambiguation pages, replaced: Graph (mathematics) → Graph (discrete mathematics) using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A higraph is a diagramming object that formalizes relations into a visual structure, it was developed by David Harel in 1988. Higraphs extend mathematical graphs by including notions of depth and orthogonality. In particular, nodes in a higraph can contain other nodes inside them, creating a hierarchy. The idea was initially developed for applications to databases, knowledge representation, and the behavioral specification of complex concurrent systems using the higraph-based language of statecharts.

Higraphs are widely used in industrial applications like UML. Recently they have been used by philosophers to formally study the use of diagrams in mathematical proofs and reasoning.

References

  • Harel, D. (1988), On Visual Formalisms, Communications of the ACM, Volume 31, Number 5
  • Grossman, O., Harel, D. (1997), On the Algorithmics of Higraphs, Technical Report, Rehovot, Israel
  • http://plato.stanford.edu/entries/diagrams/