Abstract
Statecharts are widely used for the requirements specification of reactive systems. This notation captures the requirements attributes that are concerned with the behavioral features of a system, and models these features in terms of a hierarchy of diagrams and states. The usefulness of statecharts depends primarily on their readability, that is the capability of the drawing to convey the meaning quickly and clearly. Several visualization tools for the specification of reactive systems are available in the market [15],[26],[24],[1]. Even though these tools are helpful in organizing designers’ thoughts, they are mostly sophisticated small scale graphical editors, and therefore are inadequate for the modeling of complex reactive systems. Specifically, hand made diagrams quickly become unreadable when the specification complexity and size increase. Therefore computer assistance is of paramount importance for the graphical representation of complex reactive systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Artisan Software Tools. (accessed in April 1999) Real-time studio: The rational alternative. Available from Artisan Software Tools over the Internet, http://www.artisansw.com/rtdialogue/pdfs/rational.pdf
Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1994) Algorithms for drawing graphs: an annotated bibliography. Computational Geometry Theory and Application, (4), 235–282
Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1999) Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall
Biedl, T., Kaufman, M. (1997) Area-efficient static and incremental graph drawings. In: Proceedings of the 5th. Annual European Symposium on Algorithms 1284, Springer-Verlag, 37–52
Biedl, T. C., Madden, B. P., Tollis, I. G. (1997) The three-phase method: A unified approach to orthogonal graph drawing. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 391–402
Castelló, R. (2000) Prom Informal Specification to Formalization: An Automated Visualization Approach. PhD thesis, The University of Texas at Dallas.
Castelló, R., Mili, R., Tollis, I. G. (2002) A framework for the static and interactive visualization of statecharts. Journal of Graph Algorithms and Applications 6(3)
Castelló, R., Mili, R., Tollis, I. G. (2002) Vista: a tool suite for the visualization of behavioral requirements. The Journal of Systems and Software 62, 141–159
Eades, P., Lin, T., Lin, X. (1993) Two three drawing conventions. International Journal of Computational Geometry and Applications 3(2), 133–153
Eades, P., Feng, Q.-W. (1997) Drawing clustered graphs on an orthogonal grid. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 146–157
Eades, P., Feng, Q.-W., Lin, X. (1997) Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: S. North (ed.) Graph Drawing’ 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 113–128
Gansner, E. R., North, S. C, Vo, K. P. (1988) Dag—a program that draws directed graphs. Software Practice and Experience 18(11), 1047–1062
Gansner, E. R., Koutsofios, E., North, S. C, Vo, K.-P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(32), 214–230
Harel, D. (1987) Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3), 231–274
Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi, M., Sherman, R., Shtull-Trauring, A., Trakhtenbrot, M. (1990) Statemate: A working environment for the development of complex reactive systems. IEEE Transactions on Software Engineering 16(4), 403–414
Harel, D., Yashchin, G. (1990) An algorithm for blob hierarchy layout. In: Proceedings of International Conference on Advanced Visual Interfaces, AVI’2000, Palermo, Italy
Kakoulis, K. G., Tollis, I. G. (1997) An algorithm for labeling edges of hierarchical drawings. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 169–180
Kakoulis, K. G., Tollis, I. G. (1997) On the edge label placement problem. In: S. North (ed.) Graph Drawing’ 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 241–256
Kuh, E. S., Ohtsuki, T. (1990) Recent advances in VLSI layout. Proceedings of the IEEE 78(2), 237–263
Lengauer, T. (1990) Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons
Messinger, E.B., Rowe, L. A., Henry, R. R. (1991) A divide-and-conquer algorithm for the automatic layout of large graphs. IEEE Transactions on Systems, Man, and Cybernetics 21(1), 1–11
Misue, K., Eades, P., Lai, W., Sugiyama, K. (1995) Layout adjustment and the mental map. Journal of Visual Languages and Computing 6(2), 183–210
North, S. C. (1996) Incremental layout in dynadag. In: F. J. Brandenburg (ed.) Graph Drawing’ 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 409–418
O’Donnel, R., Waldt, B., Bergstrand, J. (accessed in April 1999) Automatic code for embedded systems based on formal methods. Available from Telelogic over the Internet, http://www.Telelogic.se/solution/techpap.asp
Papakostas, A., Tollis, I. G. (1998) Interactive orthogonal graph drawing. IEEE Transactions on Computers 47(11), 1297–1309
Peterson, J. (accessed in July 2001) Overcoming the crisis in real-time software development. Available from Rational over the Internet. http://www.objectime.com/otl/technical/crisis.html
Purchase, H. (1997) Which aesthetic has the greatest effect on human understanding. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 248–261
Rational, (accessed in November 1999) Rose Java. Downloaded from Rational over the Internet. http://www.rational.com
Rowe, L. A., Davis, M., Messinger, E., Meyer, C. (1987) A browser for directed graphs. Software Practice and Experience 17(1), 61–76
Ryall, K., Marks, J., Shieber, S. (1997) An interactive system for drawing graphs. In: S. North (ed.) Graph Drawing’ 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 387–393
Seeman, J. (1997) Extending the sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 415–424
Stockmeyer, L. (1983) Optimal orientations of cells in slicing floorplan designs. Information and Control, (57), 91–101
Sugiyama, K., Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11(2), 109–125
Wimer, S., Koren, I., Cederbaum, I. (1988) Floorplans, planar graphs and layout. IEEE Transactions on Circuits and Systems, 267–278
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Castelló, R., Mili, R., Tollis, I.G. (2004). ViSta — Visualizing Statecharts. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-18638-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62214-4
Online ISBN: 978-3-642-18638-7
eBook Packages: Springer Book Archive