loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE 2001 Symposium on Human Centric Computing Languages and Environments (HCC'01)
Reasoning in Higraphs with Loose Edges
Stresa, Italy
September 05-September 07
ISBN: 0-7695-0474-4
Stuart Anderson, University of Edinburgh
John Power, University of Edinburgh
Konstantinos Tourlas, University of Edinburgh
Harel introduces the notion of zooming out as a useful operation in working with higraphs. Zooming out allows us 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.
Citation:
Stuart Anderson, John Power, Konstantinos Tourlas, "Reasoning in Higraphs with Loose Edges," hcc, pp.23, IEEE 2001 Symposium on Human Centric Computing Languages and Environments (HCC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.