Interactive visualization of large state spaces

  • Jan Friso Groote
  • Frank van Ham
Regular contribution


Insight into the global structure of a state space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a method to visualize the structure of very large state spaces with millions of nodes. The method uses a clustering based on an equivalence relation to obtain a simplified representation, which is used as a backbone for the display of the entire state space. With this visualization we are able to answer questions about the global structure of a state space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols .


State space Visualization State transition graphs Transition systems Graph drawing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arnold A (1994) Finite transition systems. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  2. 2.
    Baeten J, Weijland P (1991) Process algebra. In: Cambridge tracts in theoretical computer science, vol 18. Cambridge University Press, Cambridge, UKGoogle Scholar
  3. 3.
    Fernandez J-C, Garavel H, Kerbrat A, Mateescu R, Mounier L, Sighireanu M (1996) CADP – A Protocol Validation and Verification Toolbox. In: Proceedings of the 8th International Conference on Computer Aided Verification. LCNS, vol 1102, Springer, pp 437–440Google Scholar
  4. 4.
    Blom SCC, Fokkink WJ, Groote JF, van Langevelde IA, Lisser B, van de Pol JC (2001) mCRL: A toolset for analysing algebraic specifications. In: Computer-Aided Verification (CAV 2001). Lecture notes in computer science, vol 2102. Springer, Berlin Heidelberg New York, pp 250–254Google Scholar
  5. 5.
    Carrière J, Kazman R (1995) Research report: interacting with huge hierarchies: beyond cone trees. In: Proceedings of the IEEE conference on information visualization. IEEE Press, New York, pp 74–81Google Scholar
  6. 6.
    Gansner ER, North SC (2000) An open graph visualization system and its applications to software engineering. Softw Practice Exper 30(11):1203–1233CrossRefzbMATHGoogle Scholar
  7. 7.
    Garavel H et al. (2003) The VLTS (Very Large Transition System) Benchmark suite. Scholar
  8. 8.
    Groote JF, Pang J, Wouters AG (2003) Analysis of a distributed system for lifting trucks. The Journal of Logic and Algebraic Programming 55(1–2):21–56Google Scholar
  9. 9.
    Groote JF, van Ham F (2003) Large state space visualization. In: Proceedings of TACAS 2003, pp 585–590Google Scholar
  10. 10.
    van Ham F, van de Wetering H, van Wijk JJ (2002) Visualization of state transition graphs. IEEE Trans Visual Comput Graph 8(4):319–329CrossRefGoogle Scholar
  11. 11.
    IEEE Computer Society (1996) IEEE standard for a high performance serial bus, Std 1394-1995 , August 1996Google Scholar
  12. 12.
    Jéron T, Jard C (1994) 3D layout of reachability graphs of communicating processes. In: Proceedings of the DIMACS international workshop on graph drawing. Springer, Berlin Heidelberg New York, pp 25–32Google Scholar
  13. 13.
    Koren Y, Carmel L, Harel D (2001) ACE: A fast multiscale eigenvectors computation for drawing huge graphs. Technical Report MCS01-17, Weizmann Institute Of Science. Scholar
  14. 14.
    van Langevelde IA (2001) A compact file format for labeled transition systems. Technical report SEN-R0102, CWI, Amsterdam, The NetherlandsGoogle Scholar
  15. 15.
    Luttik SP (1997) Description and formal specification of the link layer of P1394. Technical report SEN-R9706, CWI, Amsterdam, The NetherlandsGoogle Scholar
  16. 16.
    Mauw S, Veltink GJ (eds) (1993) Algebraic specifications of communication protocols. Cambridge tracts in theoretical computer science, vol 36. Cambridge University Press, Cambridge, UKGoogle Scholar
  17. 17.
    Robertson GG, Mackinlay JD, Card SK (1991) Cone trees: animated 3D visualizations of hierarchical information. In: Proceedings of the conference on human factors in computing systems (CHI ’91), pp 189–194Google Scholar
  18. 18.
    Tutte W (1963) How to draw a graph. Proc Lond Math Soc 3(13):743–768MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.Department of Computer ScienceTechnische Universiteit EindhovenEindhovenThe Netherlands

Personalised recommendations