Reasoning in higraphs with loose edges
Anderson, S., Power, J. and Tourlas, K., 2001. Reasoning in higraphs with loose edges. In: Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587). Piscataway, NJ: IEEE, pp. 23-29.
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.
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
|Item Type||Book Sections|
|Creators||Anderson, S., Power, J. and Tourlas, K.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)