Abstract: A computer-implemented method for operating an approval manager for approving control unit functions of different safety levels in a control unit of a technical system. The method includes: carrying out diagnostic functions in the control unit, wherein a safety level is assigned to each of the diagnostic functions; depending on the detection of a fault event or a functionality by the relevant diagnostic function, adjusting an associated status variable in a status variable memory area assigned to the safety level of the diagnostic function; carrying out a control unit function, which is assigned to a particular safety level, depending on one or more associated status variables, wherein only status variables which are stored in status variable memory areas assigned to the safety level of the control unit function or higher safety levels are taken into account.

Abstract: 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.

Abstract: 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.