LayMan: A Visual Interactive Tool to Support Failure Analysis in Embedded Systems

In embedded systems domain, Component Fault Tree (CFT) is one of the most common techniques used by experts to model failure scenarios, which depict all the possible situations that could lead the underlying system to an undesired state. These models are useful not only to show the failure relations between the system components but also the structural relations between these components. However, traditional layout approaches suffer from the cluttering problem while visualizing these models, especially in the case of large-sized graph in these models. In this work, we present a generic layering tool, called LayMan (Layout Manager), that visualizes CFT models depicting some failure scenarios using the compound graphs metaphor. For this, LayMan provides a natural focus+context visualization view of the underlying CFT model and leads to produce compact abstract representation of the failure scenario, which helps in navigating over the critical parts of the underlying failure scenario. A preliminary user study of our tool, conducted with 25 users, shows higher participants' acceptance level towards the tool and its approach.

[1]  Martin Proetzsch Development Process for Complex Behavior-Based Robot Control Systems , 2010 .

[2]  Sylvain Metge,et al.  Safety assessment with AltaRica - Lessons learnt based on two aircraft system studies , 2004, IFIP Congress Topical Sessions.

[3]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Eve E. Hoggan,et al.  How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm , 2006, GD.

[5]  Marcus Raitner,et al.  Visual Navigation of Compound Graphs , 2004, GD.

[6]  Marco Bozzano,et al.  Design and Safety Assessment of Critical Systems , 2010 .

[7]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[8]  James Abello,et al.  ASK-GraphView: A Large Scale Graph Visualization System , 2006, IEEE Transactions on Visualization and Computer Graphics.

[9]  Jonathan I. Maletic,et al.  Onion Graphs for Focus+Context Views of UML Class Diagrams , 2007, 2007 4th IEEE International Workshop on Visualizing Software for Understanding and Analysis.

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Peter Eades,et al.  A Fully Animated Interactive System for Clustering and Navigating Huge Graphs , 1998, GD.

[12]  Kozo Sugiyama,et al.  Visualization of structural information: automatic drawing of compound digraphs , 1991, IEEE Trans. Syst. Man Cybern..

[13]  Shah Rukh Humayoun,et al.  CluE: An Algorithm for Expanding Clustered Graphs , 2014, 2014 IEEE Pacific Visualization Symposium.

[14]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[15]  Tamara Munzner,et al.  GrouseFlocks: Steerable Exploration of Graph Hierarchy Space , 2008, IEEE Transactions on Visualization and Computer Graphics.

[16]  Kozo Sugiyama,et al.  A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR , 1995, Graph Drawing.

[17]  Peter Liggesmeyer,et al.  A New Component Concept for Fault Trees , 2003, SCS.

[18]  Robert F. Cohen,et al.  Planarity for Clustered Graphs , 1995, ESA.

[19]  Roberto Tamassia,et al.  Algorithmic Patterns for Orthogonal Graph Drawing , 1998, GD.