A framework for the static and interactive visualization of statecharts

Journal of Graph Algorithms and Applications

Volumn 6, Issue 3, 2002, Pages 313-351

  Castelló, Rodolfo ^a   Mili, Rym ^b   Tollis, Ioannis G ^b  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043118924     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00056     Document Type: Conference Paper

References (39)

1. G. D. 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. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
3. T. Biedl and M. Kaufman. Area-efficient static and incremental graph drawings. In Proceedings of the 5th. Annual European Symposium on Algorithms, volume 1284, pages 37-52. Springer-Verlag, 1997.
4. T. C. Biedl, B. P. Madden, and I. G. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. D. Battista, editor, Graph Drawing (Proceedings GD'97), pages 391-402. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
5. G. Booch, I. Jacobson, and J. Rumbaugh. The Unifed Modeling Language User Guide. Addison-Wesley, 1998.
6. R. Castelló. From Informal Specification to Formalization: An Automated Visualization Approach. PhD thesis, The University of Texas at Dallas., 2000.
7. R. Castelló, R. Mili, and I. G. Tollis. Vista: A tool suite for the visualization of statecharts. to appear on Journal of Systems and Software., (0), 2002.
8. J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for Point Feature Label Placement. ACM Trans. on Graphics, 14(3):203-232, July 1995.
9. S. Doddi, M. V. Marathe, A. Mirzaian, B. M. Moret, and B. Zhu. Map Labeling and Its Generalizations. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 148-157, 1997.
10. P. Eades and Q.-W. Feng. Drawing clustered graphs on an orthogonal grid. In G. D. Battista, editor, Graph Drawing (Proceedings GD'97), pages 146-157. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
11. P. Eades, Q.-W. 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.
12. P. Eades, T. Lin, and X. Lin. Two three drawing conventions. International Journal of Computational Geometry and Applications., 3(2):133-153, 1993.
13. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annual ACM Sympos. Comput. Geom., pages 281-288, 1991.
14. E. R. Gansner, E. Koutsofios, S. C. North, and K.-P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(32):214-230, March 1993.
15. 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.
16. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231-274, June 1987.
17. D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot. Statemate: A working environment for the development of complex reactive systems. IEEE Transactions on Software Engineering, 16(4):403-414, May 1990.
18. 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.
19. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
20. K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In G. D. Battista, editor, Graph Drawing (Proceedings GD'97), pages 169-180. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
21. 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.
22. E. S. Kuh and T. Ohtsuki. Recent advances in VLSI layout. Proceedings of the IEEE, 78(2):237-263, 1990.
23. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, 1990.
24. 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.
25. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6(2):183-210, 1995.
26. S. C. North. Incremental layout in dynadag. In F. J. Brandenburg, editor, Graph Drawing (Proceedings GD'95), pages 409-418. Springer-Verlag, 1996. Lecture Notes in Computer Science 1027.
27. R. O'Donnel, B. Waldt, and J. Bergstrand. Automatic code for embedded systems based on formal methods. Available from Telelogic over the Internet. http://www.Telelogic.se/solution/techpap.asp. Accessed on April 1999.
28. A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297-1309, 1998.
29. 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.
30. Rational. Rose java. Downloaded from Rational over the Internet. http://www.rational.com. Accessed on November 1999.
31. 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.
32. K. Ryall, J. Marks, and S. Shieber. An interactive system for drawing graphs. In S. North, editor, Graph Drawing (Proceedings GD'96), pages 387-393. Springer-Verlag, 1997. Lecture Notes in Computer Science 1190.
33. J. Seeman. Extending the sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In G. D. Battista, editor, Graph Drawing (Proceedings GD'97), pages 415-424. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353.
34. L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, (57):91-101, 1983.
35. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, February 1981.
36. A. S. 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.
37. F. Wagner and A. Wolff. Map labeling heuristics: Provably good and practically useful. In Proc. 11th Annual. ACM Sympos. Comput. Geom., pages 109-118, 1995.
38. S. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs and layout. IEEE Transactions on Circuits and Systems, pages 267-278, 1988.
39. P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 1972.