Reasoning in Higraphs with Loose Edges

  • Authors:
  • Stuart Anderson;John Power;Konstantinos Tourlas

  • Affiliations:
  • -;-;-

  • Venue:
  • HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Harel introduces the notion of zooming out as a usefuloperation in working with higraphs. Zooming out allows usto consider less detailed versions of a higraph by droppingsome detail from the description in a structured manner. Althoughthis is a very useful operation it seems it can be misleadingin some circumstances by allowing the user of thezoomed out higraph to make false inferences given the usualtransition system semantics for higraphs. We consider oneapproach to rectifying this situation by following throughHarel's suggestion that, in some circumstances, it may beuseful to consider higraphs with edges that have no specificorigin or destination. We call these higraphs loose higraphsand show that an appropriate definition of zooming on loosehigraphs avoids some of the difficulties arising from the useof zooming. We also consider a logic for connectivity inloose higraphs.