Reasoning in higraphs with loose edges

S Anderson, John Power, K Tourlas

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

Harel (1988) introduces the notion of zooming out as a useful operation in working with higraphs. Zooming out allows one to consider less detailed versions of a higraph by dropping some detail from the description in a structured manner. Although this is a very useful operation it seems it can be misleading in some circumstances by allowing the user of the zoomed out higraph to make false inferences given the usual transition system semantics for higraphs. We consider one approach to rectifying this situation by following through Harel's suggestion that, in some circumstances, it may be useful to consider higraphs with edges that have no specific origin or destination. We call these higraphs loose higraphs and show that an appropriate definition of zooming on loose higraphs avoids some of the difficulties arising from the use of zooming. We also consider a logic for connectivity in loose higraphs
Original languageEnglish
Title of host publicationProceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages23-29
Number of pages7
DOIs
Publication statusPublished - 2001

Fingerprint Dive into the research topics of 'Reasoning in higraphs with loose edges'. Together they form a unique fingerprint.

  • Cite this

    Anderson, S., Power, J., & Tourlas, K. (2001). Reasoning in higraphs with loose edges. In Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587) (pp. 23-29). IEEE. https://doi.org/10.1109/HCC.2001.995229