73,674 research outputs found

    Visualization of state transition graphs

    Get PDF
    State transition graphs are important in computer science and engineering where they are used to analyze the behavior of computer-based systems. In such a graph nodes represent states a system can be in. Links, or directed edges, represent transitions between states. Research in visualization investigates the application of interactive computer graphics to understand large and complex data sets. Large state transition graphs fall into this category. They often contain tens of thousands of nodes, or more, and tens to hundreds of thousands of edges. Also, they describe system behavior at a low abstraction level. This hinders analysis and insight. This dissertation presents a number of techniques for the interactive visualization of state transition graphs. Much of the work takes advantage of multivariate data associated with nodes and edges. Using an experimental approach, several new methods were developed in close collaboration with a number of users. The following approaches were pursued: • Selection and projection. This technique provides the user with visual support to select a subset of node attributes. Consequently, the state transition graph is projected to 2D and visualized in a second, correlated visualization. • Attribute-based clustering. By specifying subsets of node attributes and clustering based on these, the user generates simplified abstractions of a state transition graph. Clustering generates hierarchical, relational, and metric data, which are represented in a single visualization. • User-defined diagrams. With this technique the user investigates state transition graphs with custom diagrams. Diagrams are parameterized by linking their graphical properties to the data. Diagrams are integrated in a number of correlated visualizations. • Multiple views on traces. System traces are linear paths in state transition graphs. This technique provides the user with different perspectives on traces. • Querying nodes and edges. Direct manipulation enables the user to interactively inspect and query state transition graphs. In this way relations and patterns can be investigated based on data associated with nodes and edges. This dissertation shows that interactive visualization can play a role during the analysis of state transition graphs. The ability to interrogate visual representations of such graphs allows users to enhance their knowledge of the modeled systems. It is shown how the above techniques enable users to answer questions about their data. A number of case studies, developed in collaboration with system analysts, are presented. Finally, solutions to challenges encountered during the development of the visualization techniques are discussed. Insights generic to the field of visualization are considered and directions for future work are recommended

    A General Introduction To Graph Visualization Techniques

    Get PDF
    Generally, a graph is an abstract data type used to represent relations among a given set of data entities. Graphs are used in numerous applications within the field of information visualization, such as VLSI (circuit schematics), state-transition diagrams, and social networks. The size and complexity of graphs easily reach dimensions at which the task of exploring and navigating gets crucial. Moreover, additional requirements have to be met in order to provide proper visualizations. In this context, many techniques already have been introduced. This survey aims to provide an introduction on graph visualization techniques helping the reader to gain a first insight into the most fundamental techniques. Furthermore, a brief introduction about navigation and interaction tools is provided

    A novel approach for analysis of attack graph

    Get PDF

    Solving the TTC 2011 Reengineering Case with GrGen.NET

    Full text link
    The challenge of the Reengineering Case is to extract a state machine model out of the abstract syntax graph of a Java program. The extracted state machine offers a reduced view on the full program graph and thus helps to understand the program regarding the question of interest. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).Comment: In Proceedings TTC 2011, arXiv:1111.440
    • …
    corecore