DETERMINING DEADLOCK-CRITICAL RELATIONS BETWEEN COMPONENTS OF A VEHICLE SYSTEM
    1.
    发明申请
    DETERMINING DEADLOCK-CRITICAL RELATIONS BETWEEN COMPONENTS OF A VEHICLE SYSTEM 有权
    确定车辆系统组件之间的关键关键

    公开(公告)号:US20110153813A1

    公开(公告)日:2011-06-23

    申请号:US12916876

    申请日:2010-11-01

    IPC分类号: G06F15/173

    CPC分类号: G06F17/509 G06F17/5095

    摘要: In a method for determining deadlock-critical relations between networked components of a vehicle system, a graph, which at least partially represents the inhibit relations defined in the vehicle system and which has nodes and edges, is used, in which a classification takes place of at least a portion of the edges on the basis of the properties of the edges and the nodes connected by the edges, a prioritization of the edges on the basis of the classification takes place, and a determination of shortest deadlock-critical cycles for all nodes and at least some of the edges on the basis of the prioritization is implemented.

    摘要翻译: 在用于确定车辆系统的网络组件之间的死锁关键性关系的方法中,使用至少部分地表示在车辆系统中定义并具有节点和边缘的具有节点和边缘的禁止关系的图,其中进行分类 基于边缘的属性和由边缘连接的节点的边缘的至少一部分,基于分类进行边缘的优先化,并且确定所有节点的最短的死锁关键周期 并且实现基于优先级排列的至少一些边缘。

    Determining deadlock-critical relations between components of a vehicle system
    2.
    发明授权
    Determining deadlock-critical relations between components of a vehicle system 有权
    确定车辆系统部件之间的死锁关键关系

    公开(公告)号:US08812655B2

    公开(公告)日:2014-08-19

    申请号:US12916876

    申请日:2010-11-01

    IPC分类号: G06F15/173

    CPC分类号: G06F17/509 G06F17/5095

    摘要: In a method for determining deadlock-critical relations between networked components of a vehicle system, a graph, which at least partially represents the inhibit relations defined in the vehicle system and which has nodes and edges, is used, in which a classification takes place of at least a portion of the edges on the basis of the properties of the edges and the nodes connected by the edges, a prioritization of the edges on the basis of the classification takes place, and a determination of shortest deadlock-critical cycles for all nodes and at least some of the edges on the basis of the prioritization is implemented.

    摘要翻译: 在用于确定车辆系统的网络组件之间的死锁关键性关系的方法中,使用至少部分地表示在车辆系统中定义并具有节点和边缘的具有节点和边缘的禁止关系的图,其中进行分类 基于边缘的属性和由边缘连接的节点的边缘的至少一部分,基于分类进行边缘的优先化,并且确定所有节点的最短的死锁关键周期 并且实现基于优先级排列的至少一些边缘。