The University of New Mexico

Power System Graph Converter

Authors: Dominik Neumayr (dominik.neumayr at, Svetlana V. Poroseva

Power System Graph Converter v.0
Copyright@2011, The Florida State University Research Foundation, Inc. All right reserved.

This software comes "as is" in a form of a single executable Jar file without warranties of any kind and for educational/non-commercial use only

This is a preliminary work associated with copyright material that is an initial GL non-commercial open-source coding work that provides an opportunity to draw a network topology with sources and sinks and to automatically convert a network drawing into an adjacency matrix or list. An example of such a network topology is a simplified power system diagram that includes only generators (sources), loads (sinks), links, and intersections of links. An adjacency matrix is the symmetric matrix that describes the connectivity of the system’s components. The matrix columns/rows correspond to the network elements. Intersections are not included in the matrix. If two components in the system are adjacent, a matrix element on the crossing of the corresponding column and row is equal to unit, otherwise, it is zero.

This software is purposefully created for the automatic conversion of a graphical representation of a network with sources and sinks into a mathematical form suitable for conducting the survivability analysis of large-scale networks. For the network survivability, links are as important as sources and sinks. Indeed, by removing links, one can isolate a perfectly functioning otherwise source or a sink from the network and make it unavailable. Links are more vulnerable to external damage caused by adverse events than sources and sinks. Different links connecting the same nodes can have different vulnerability and susceptibility. Thus, in a generated adjacency matrix (list), links are included as individual elements. What is not included are interconnections or junctions (physical connection) of links, because a fault in an interconnection can be represented by faults in adjacent links.

Such a representation of networks is diiferent from the one used in the traditional reliability analysis and the main stream of the network analysis. Our approach may or may not result in the increased size of the adjacency matrix (list). In any case, it allows one a more straightforward description of fault scenarios, their counting, and assigning the likelihood of their occurring.

Software generates a structured adjacency matrix (list). That is, it contains additional information on whether a network element generates, consumes, or simply transfers power (quality of interest) from one element to another. Specifically, initial positions i,j = 1,...,g in a structured adjacency matrix (list) are assigned to sources (g is the number of sources/generators). The following positions i,j=g+1,...,g+v, are reserved for sinks (v is the number of sinks/loads). The remaining elements are links that simply transfer power. Using a structured adjacency matrix (list) further reduces computational time required by search algorithms. The matrix shown corresponds to the network shown as an example

In addition to the network representation described above, the software has an option to draw a network using only links of three different types: links that supply power (quality of interest) to a network (such links contain sources), links that consume power (they contain sinks), and links that deliver power between links of those two types. For example, the network shown in the previous figure can be represented by links only as following.

The software interface is intuitive and easy to use. Using the toolbar and mouse buttons, one can draw a network of any complexity relatively fast. The conversion into the adjacency matrix/list is a one-click operation.

To install software, it is sufficient to download a single file: power_sys_drawing_RC_1.0.jar. No compilation is necessary. Clicking on this file should open the interface as follows

If instead, a system suggests to open an archive or shows a file as a set of directories, it means that either the system should be upgraded to support such Java applications or you can run it in a command line, for example, "java -jar *.jar" in linux systems.

Download here v.1

The software should be compatible with any computer platform that supports Java applications. So far, it has been successfully tested on Windows 7, Windows Vista, Red Hat Enterprise Linux, Ubunut Linux, and Mac OS 10.6.4 or better platforms.

More detailed software description can be found in

  • D. Neumayr, S. V. Poroseva, “On Development of Computational Tools for Evaluating System Survivability Due to Its Topology,” AIAA-2011-1818 , Proc. the 52st AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Denver, April 4-11, 2011.

  • About the network represenation:

  • S. V. Poroseva, “Designing Power System Topologies of Enhanced Survivability,” AIAA-2010-2572 , Proc. of the 51st AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Orlando, April 12-15, 2010.
  • S. V. Poroseva, ““Selfish” algorithm for optimizing the network survivability analysis,” Optimization and Engineering (submitted),

  • The authors would like to acknowledge a partial support from the Office of Naval Research (grant N00014-08-1-0080) and the Engineering Research Center for Future Renewable Electric Energy Delivery and Management Systems supported by the National Science Foundation (grant NSF EEC-0812121) during their affiliation with the Center for Advanced Power Systems, Florida State University, where the project was initiated.