Zooming-out on Higraph-based diagrams

Stuart Anderson, John Power, Konstantinos Tourlas

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Computing system representations based on Harel's notion of hierarchical graph, or higraph, have become popular since the invention of Statecharts. Such hierarchical representations support a useful filtering operation, called “previous termzoomingnext term-out”, which is used to manage the level of detail presented to the user designing or reasoning about a large and complex system. In the framework of (lightweight) category theory, we develop the mathematics of previous termzooming e ut for higraphs with loose edges, formalise the transition semantics of such higraphs and conduct an analysis of the effect the operation of previous termzooming out has on the semantic interpretations, as required for the soundness of reasoning arguments depending on zoom-out steps.
Original languageEnglish
Pages (from-to)201-211
Number of pages11
JournalElectronic Notes in Theoretical Computer Science
Volume61
DOIs
Publication statusPublished - Jan 2002

Fingerprint

Diagram
Reasoning
Semantics
Statecharts
Category Theory
Patents and inventions
Soundness
Large scale systems
Complex Systems
Filtering
Computing
Term
Graph in graph theory
Framework
Interpretation

Cite this

Zooming-out on Higraph-based diagrams. / Anderson, Stuart; Power, John; Tourlas, Konstantinos.

In: Electronic Notes in Theoretical Computer Science, Vol. 61, 01.2002, p. 201-211.

Research output: Contribution to journalArticle

Anderson, Stuart ; Power, John ; Tourlas, Konstantinos. / Zooming-out on Higraph-based diagrams. In: Electronic Notes in Theoretical Computer Science. 2002 ; Vol. 61. pp. 201-211.
@article{f739b597b0cd406e8dbbb747c006dce4,
title = "Zooming-out on Higraph-based diagrams",
abstract = "Computing system representations based on Harel's notion of hierarchical graph, or higraph, have become popular since the invention of Statecharts. Such hierarchical representations support a useful filtering operation, called “previous termzoomingnext term-out”, which is used to manage the level of detail presented to the user designing or reasoning about a large and complex system. In the framework of (lightweight) category theory, we develop the mathematics of previous termzooming e ut for higraphs with loose edges, formalise the transition semantics of such higraphs and conduct an analysis of the effect the operation of previous termzooming out has on the semantic interpretations, as required for the soundness of reasoning arguments depending on zoom-out steps.",
author = "Stuart Anderson and John Power and Konstantinos Tourlas",
year = "2002",
month = "1",
doi = "10.1016/S1571-0661(04)00314-7",
language = "English",
volume = "61",
pages = "201--211",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",

}

TY - JOUR

T1 - Zooming-out on Higraph-based diagrams

AU - Anderson, Stuart

AU - Power, John

AU - Tourlas, Konstantinos

PY - 2002/1

Y1 - 2002/1

N2 - Computing system representations based on Harel's notion of hierarchical graph, or higraph, have become popular since the invention of Statecharts. Such hierarchical representations support a useful filtering operation, called “previous termzoomingnext term-out”, which is used to manage the level of detail presented to the user designing or reasoning about a large and complex system. In the framework of (lightweight) category theory, we develop the mathematics of previous termzooming e ut for higraphs with loose edges, formalise the transition semantics of such higraphs and conduct an analysis of the effect the operation of previous termzooming out has on the semantic interpretations, as required for the soundness of reasoning arguments depending on zoom-out steps.

AB - Computing system representations based on Harel's notion of hierarchical graph, or higraph, have become popular since the invention of Statecharts. Such hierarchical representations support a useful filtering operation, called “previous termzoomingnext term-out”, which is used to manage the level of detail presented to the user designing or reasoning about a large and complex system. In the framework of (lightweight) category theory, we develop the mathematics of previous termzooming e ut for higraphs with loose edges, formalise the transition semantics of such higraphs and conduct an analysis of the effect the operation of previous termzooming out has on the semantic interpretations, as required for the soundness of reasoning arguments depending on zoom-out steps.

UR - http://dx.doi.org/10.1016/S1571-0661(04)00314-7

U2 - 10.1016/S1571-0661(04)00314-7

DO - 10.1016/S1571-0661(04)00314-7

M3 - Article

VL - 61

SP - 201

EP - 211

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -