Transient state nodes and a method for their identification

A machine-readable medium having stored thereon sequences of instructions for detecting transient state points in a digital integrated circuit, the sequences of instructions including instructions that when executed by a data processing system, cause the data processing system to perform:

• (a) providing a representation of a schematic of the digital integrated circuit containing stable state points;
• (b) defining a graph G=(V, E1, E2), where V is a set of vertices, E1 is a set of directed edges, and E2 is a set of undirected edges, and wherein both a directed edge and an undirected edge can exist between a pair of vertices in the graph, the graph being constructed in accordance with the following:
• (i) for each node in the digital integrated circuit, creating a vertex in the graph;
• (ii) for every transistor in the digital integrated circuit, adding a directed edge from the vertex representing the gate node of said transistor to the vertex representing the source node of said transistor, adding a directed edge from the vertex representing the gate node of said transistor to the vertex representing the drain node of said transistor, and adding an undirected edge between the vertices representing the source node and the drain node of said transistor, a directed edge from a vertex A to a vertex B being denoted vertex A being the “parent” of vertex B, and two vertices connected by an undirected edge being denoted as “peers”;
• and
• (iii) for every submodule in the circuit, adding a directed edge from each input of the submodule to all of the outputs of said submodule, the weight of all edges being taken as 1;
• (c) creating the all pairs shortest path matrix of the graph G using only the directed edges;
• (d) for each stable state node in the circuit, making a peer list of all its peers in the graph G;
• (e) for each peer, checking to determine if said peer is an input or a stable state node, and, in the event that said peer is an input or a stable state node, then checking the next peer in said peer list, and, in the event that said peer is not an input or a stable state node, then making a parent list of all parents of said peer;
• (f) for each said parent,
• (i) checking if said parent is an input or a stable state node, and, in the event that said parent is an input or a stable state node, then checking the next parent in said parent list, and, in the event that said parent is not an input or a stable state node, determining if a path exists form an input to said parent;
• (ii) in the event that a path does not exist from an input to said parent, then checking the next parent in said parent list, and, in the event that a path does exist from an input to said parent, then determining if said path consists of directed edges only;
• (iii) in the event that said path does not consist of directed edges only, then checking the next parent in said parent list, and, in the event that said path does consists of directed edges only, then determining if said path is greater than or equal to a threshold length;
• and
• (iv) in the event that said path is not equal to or greater than the threshold length, then checking the next parent in said parent list, and, in the event that said path is greater than or equal to the threshold length, then identifying said parent as a transient state node.