Method and system that determine whether or not two graph-like representations of two systems describe equivalent systems

A method, carried out by a computer system having one or more processors, one or more memories, one or more graph databases, and computer instructions stored in the one or more memories that, when executed by one or more of the one or more processors, control the computer system to determine whether a first graph is equivalent to a second graph by:

• storing the first graph and the second graph in one or more of the one or more graph databases, and
• determining whether or not the first and second graphs are equivalent by
• extracting two or more sets of subgraphs from each of the first and second graphs, each set of subgraphs extracted from the first graph corresponding to a complementary set of subgraphs extracted from the second graph,
• transforming the subgraphs in the sets of subgraphs into trees within corresponding sets of trees,
• labeling nodes of the trees in the corresponding sets of trees, and
• comparing node labels of trees selected from the sets of trees to generate a return value stored in one of the one or more memories that indicates whether or not the first and second graphs are equivalent.

Computer instructions stored on a physical data-storage device that, when executed by one or more processors of a computer system having the one or more processors, one or more memories, and one or more graph databases, control the computer system to determine whether a first graph is equivalent to a second graph by:

• storing the first graph and the second graph in one or more of the one or more graph databases, and
• determining whether or not the first and second graphs are equivalent by
• extracting two or more sets of subgraphs from each of the first and second graphs, each set of subgraphs extracted from the first graph corresponding to a complementary set of subgraphs extracted from the second graph,
• transforming the subgraphs in the sets of subgraphs into trees within corresponding sets of trees,
• labeling nodes of the trees in the corresponding sets of trees, and
• comparing node labels of trees selected from the sets of trees to generate a return value stored in one of the one or more memories that indicates whether or not the first and second graphs are equivalent.