An Algorithmic Framework for Visualizing Statecharts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 139-149

  Castello R ^a   Mili, R ^a   Tollis, I G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS);

ALGORITHMIC FRAMEWORK; AUTOMATIC GENERATION; COOPERATIVE ENVIRONMENT; EDGE CROSSING; FLOOR-PLANNING; HIERARCHICAL DECOMPOSITIONS; REACTIVE SYSTEM; STATE CHART DIAGRAMS;

ASPECT RATIO;

EID: 84958527395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_13     Document Type: Conference Paper

References (28)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., (4):235-282, 1994.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
3. G. Booch, I. Jacobson, and J. Rumbaugh. The Unified Modeling Language User Guide. Addison-Wesley, 1998.
4. R. Castellfio, R. Mili, and I. G. Tollis. Automatic layout of statecharts. Technical Report UTD-04-00, University of Texas at Dallas, 2000.
5. P. Eades and Q. Feng. Drawing clustered graphs on an orthogonal grid. In G. Di Battista, editor, Graph Drawing (Proceedings GD'97), pages 146-157. Springer- Verlag, 1997. Lecture Notes in Computer Science 1353.
6. P. Eades, Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph Drawing (Proceedings GD'96), pages 113-128. Springer-Verlag, 1997. Lecture Notes in Computer Science 1190.
7. E. R. G E. Koutsofios, S. C. North, and K. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(32):214-230, March 1993.
8. E. R. Gansner, S. C. North, and K. P. Vo. Dag|a program that draws directed graphs. Software Practice and Experience, 18(11):1047-1062, November 1988.
9. D. Harel. Statecharts: A visual formalism for complex systems. Science of Com- puter Programming, 8(3):231-274, June 1987.
10. D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull- Trauring, and M. Trakhtenbrot. Statemate: A working environment for the deve- lopment of complex reactive systems. IEEE Transactions on Software Engineering, 16(4):403-414, May 1990.
11. D. Harel and G. Yashchin. An algorithm for blob hierarchy layout. In Proceedings of International Conference on Advanced Visual Interfaces, AVI'2000, Palermo, Italy, May 1990.
12. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
13. K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In G. Di Battista, editor, Graph Drawing (Proceedings GD'97), pages 169-180. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
14. K. G. Kakoulis and I. G. Tollis. On the edge label placement problem. In S. North, editor, Graph Drawing (Proceedings GD'96), pages 241-256. Springer-Verlag, 1997. Lecture Notes in Computer Science 1190.
15. E. S. Kuh and T. Ohtsuki. Recent advances in VLSI layout. Proceedings of the IEEE, 78(2):237-263, 1990.
16. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley and Sons, 1990.
17. E. B. Messinger, L. A. Rowe, and R. R. Henry. A divide-an-conquer algorithm for the automatic layout of large graphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(1):1-11, February 1991.
18. R. O'Donnel, B. Waldt, and J. Bergstrand. Automatic code for embedded sy- stems based on formal methods. Available from Telelogic over the Internet. http://www.Telelogic.se/solution/techpap.asp. Accessed on April 1999.
19. J. Peterson. Overcoming the crisis in real-time software development. Available from Objectime over the Internet. http://www.Objectime.on.ca/otl/technical/crisis.pdf. Accessed on April 1999.
20. H. Purchase. Which aesthetic has the greatest Effect on human understanding. In G. Di Battista, editor, Graph Drawing (Proceedings GD'97), pages 248-261. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
21. Rational. Rosejava. Downloaded from Rational over the Internet. http://www.rational.com. Accessed on November 1999.
22. L. A. Rowe, M. Davis, E. Messinger, and C. Meyer. A bowser for directed graphs. Software Practice and Experience, 17(1):61-76, January 1987.
23. J. Seeman. Extending the sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In G. Di Battista, editor, Graph Drawing (Proceedings GD'97), pages 415-424. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
24. L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Informa- tion and Control, (57):91-101, 1983.
25. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hier- archical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, February 1981.
26. Artisan Software Tools. Real-time studio: The rational alternative. Available from Artisan Software Tools over the Internet. http://www.artisansw.com/rtdialogue/pdfs/rational.pdf. Accessed on April 1999.
27. S. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs and layout. IEEE Transactions on Circuits and Systems, pages 267-278, 1988.
28. P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 1972.