METHOD AND SYSTEM THAT DETERMINE WHETHER OR NOT TWO GRAPH-LIKE REPRESENTATIONS OF TWO SYSTEMS DESCRIBE EQUIVALENT SYSTEMS
    2.
    发明申请
    METHOD AND SYSTEM THAT DETERMINE WHETHER OR NOT TWO GRAPH-LIKE REPRESENTATIONS OF TWO SYSTEMS DESCRIBE EQUIVALENT SYSTEMS 有权
    确定两个系统的两个表示类似于两个系统的描述的方法和系统描述等效系统

    公开(公告)号:US20160110434A1

    公开(公告)日:2016-04-21

    申请号:US14517710

    申请日:2014-10-17

    Applicant: VMware, Inc.

    CPC classification number: G06F17/30958 G06F11/30 G06F11/3604 H04L41/12

    Abstract: The current document is directed to methods and systems that determine whether or not two graph-like representations of two physically or temporally distinct computer systems or computer-system configurations are equivalent. The currently described methods and systems extract a first and second ordered set of subgraphs from each of a first and second graph-like representation of a first and a second computer system. The ordered sets of subgraphs are logically aligned, forming a set of subgraph pairs. The currently described methods and systems transform the first and second subgraph of each subgraph pair into a corresponding first and second set of trees, label the trees, and then compare labels at each level of the trees to determine whether or not an isomorphic tree can be found in the second set of trees for each tree in the first set of trees.

    Abstract translation: 当前文档针对的是确定两个物理或时间上不同的计算机系统或计算机系统配置的两个图形表示是否相当的方法和系统。 当前描述的方法和系统从第一和第二计算机系统的第一和第二图形表示中的每一个提取第一和第二有序的子图集合。 有序的子图集合在逻辑上对齐,形成一组子图对。 目前描述的方法和系统将每个子图对的第一和第二子图转换成对应的第一和第二组树,标记树,然后比较树的每个级别的标签,以确定同构树是否可以 在第一组树中的每棵树的第二组树中发现。

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

    公开(公告)号:US09703890B2

    公开(公告)日:2017-07-11

    申请号:US14517710

    申请日:2014-10-17

    Applicant: VMware, Inc.

    CPC classification number: G06F17/30958 G06F11/30 G06F11/3604 H04L41/12

    Abstract: The current document is directed to methods and systems that determine whether or not two graph-like representations of two physically or temporally distinct computer systems or computer-system configurations are equivalent. The currently described methods and systems extract a first and second ordered set of subgraphs from each of a first and second graph-like representation of a first and a second computer system. The ordered sets of subgraphs are logically aligned, forming a set of subgraph pairs. The currently described methods and systems transform the first and second subgraph of each subgraph pair into a corresponding first and second set of trees, label the trees, and then compare labels at each level of the trees to determine whether or not an isomorphic tree can be found in the second set of trees for each tree in the first set of trees.

Patent Agency Ranking