2001
DOI: 10.1002/spe.418
|View full text |Cite
|
Sign up to set email alerts
|

Automatic layout of statecharts

Abstract: Graphical notations are widely used for system specification. The usefulness of these notations depends primarily on their readability. Hence, automatic methods are needed to obtain efficient and understandable graphical representations of requirements. In this paper, we present an algorithm that automatically generates layouts of statecharts. We assume that relevant information is stored in a structure that we call a decomposition tree, and we draw the graph that models a statechart in a hierarchical fashion.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2001
2001
2010
2010

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…Third, a readable layout of the generated HFSMs is a difficult problem (see, for example, Castello et al [2002]; Harel and Yashchin [2000]). Most graph layout algorithms do not take into account hierarchical states.…”
Section: Scalability and Usabilitymentioning
confidence: 99%
“…Third, a readable layout of the generated HFSMs is a difficult problem (see, for example, Castello et al [2002]; Harel and Yashchin [2000]). Most graph layout algorithms do not take into account hierarchical states.…”
Section: Scalability and Usabilitymentioning
confidence: 99%
“…Eichelberger and Gudenberg [28] discuss existing automatic layout methods for class diagrams and present their approach to laying out class diagrams that respect aesthetic rules, such as those described by [27]. Castello et al [42] propose an automatic layout algorithm that improves the readability of state chart diagrams. It reduces the number of edge crossings and edge bends.…”
Section: Graphical Refactoringsmentioning
confidence: 99%
“…17 The approach is highly adaptable and a lot of variants and extensions were introduced to handle applicationspecific requirements like compound graphs 35,36 constraint vertex order 37,38 or vertices of arbitrary size. 39 It was successfully applied in different areas like visualization of UML class diagrams, 40,41 statecharts, 42,43 biochemical pathways 44,45 or compiler graphs. 46…”
Section: Visualization Of Layered Graph Structuresmentioning
confidence: 99%