WO2021219275A1 - Procédé, dispositif, programme informatique et support d'enregistrement lisible par ordinateur pour générer une base de données orientée graphe pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie d'un système mécatronique - Google Patents

Procédé, dispositif, programme informatique et support d'enregistrement lisible par ordinateur pour générer une base de données orientée graphe pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie d'un système mécatronique Download PDF

Info

Publication number
WO2021219275A1
WO2021219275A1 PCT/EP2021/054995 EP2021054995W WO2021219275A1 WO 2021219275 A1 WO2021219275 A1 WO 2021219275A1 EP 2021054995 W EP2021054995 W EP 2021054995W WO 2021219275 A1 WO2021219275 A1 WO 2021219275A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
node
edges
directed
function
Prior art date
Application number
PCT/EP2021/054995
Other languages
German (de)
English (en)
Inventor
Melissa Gresser
Dominik Brehl
Original Assignee
Bayerische Motoren Werke Aktiengesellschaft
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bayerische Motoren Werke Aktiengesellschaft filed Critical Bayerische Motoren Werke Aktiengesellschaft
Publication of WO2021219275A1 publication Critical patent/WO2021219275A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists

Definitions

  • Method, device, computer program and computer-readable storage medium for generating a graph database for determining the scope of diagnosis for possible errors in at least one component of a mechatronic system
  • a method for generating a graph database for determining the scope of diagnosis for possible errors in at least one component of a mechatronic system is specified.
  • a device, a computer program and a computer-readable storage medium are specified.
  • One problem to be solved consists in specifying a method in which at least one defective component of a mechatronic system can be analyzed and determined particularly easily and efficiently. Furthermore, a device and a computer program are to be specified which can carry out such a method. In addition, a computer-readable storage medium with such a computer program is to be specified.
  • the mechatronic system is integrated into a vehicle, for example.
  • vehicle is, for example, a motor vehicle, such as a passenger car, a truck, a van and / or a motorcycle.
  • vehicle can be an aircraft or a watercraft.
  • the mechatronic system is designed, for example, to operate and / or control the vehicle.
  • the mechatronic system can be divided into a large number of subsystems. A large number of components are assigned to each subsystem, for example.
  • the mechatronic system thus comprises a coarse-grained level that corresponds to the system and a fine-grained level that corresponds to the components.
  • the components of the mechatronic system usually influence each other. Many of these components are therefore interdependent. This can be understood to mean that, for example, an output signal from one of the components is used as the input signal from another component.
  • At least some of the components can be electrical components, such as actuators and / or sensors. It is also possible that at least some of the components are virtual components.
  • the virtual components are each a software application, for example.
  • a corresponding function can also be assigned to each of the components. If, for example, a component is defective, the defective component can have a malfunction. One of the malfunctions can be for example, can be observed by one or more error memory entries.
  • All components, functions, malfunctions and fault memory entries can be represented in the form of a graph, for example.
  • every component, every function, every malfunction and every fault memory entry is representative of a node in the graph.
  • first nodes, second nodes, third nodes and fourth nodes are provided.
  • At least some of the first and / or the second and / or the third and / or the fourth nodes are connected to one another by directed first edges, directed second edges and directed third edges.
  • At least one attribute is assigned to each of the first nodes, the second nodes, the third nodes and the fourth nodes.
  • the attribute is, for example, a clear identification of the component, function, malfunction and / or fault memory entry assigned to the respective node.
  • At least one further attribute can be assigned to each of the first edges, the second edges and the third edges.
  • the attribute is, for example, a description of a type or strength of a relationship between the nodes.
  • at least some of the first nodes are connected to at least some of the second nodes by directed first edges.
  • at least some of the second nodes are connected to at least some of the third nodes by directed second edges and at least some of the third nodes are connected to at least some of the fourth nodes by directed third edges.
  • At least some of the first edges are directed from the first nodes towards the second nodes. Furthermore, for example at least some of the first edges are directed from the second nodes towards the first nodes.
  • each of the second edges is directed from the second node towards the third node, for example.
  • Each of the third edges is directed, for example, from the third node to the fourth node
  • a bipartite graph is generated as a function of the provided third and the provided fourth nodes.
  • the bipartite graph comprises the third nodes and the fourth nodes, which are each connected to one another by further third directed edges. The other third edges are directed from the fourth node to the third node.
  • the bipartite graph is a graph in which the third node and the fourth node are divided into two independent subsets U and V. This means that every further third edge only connects thirds Node of subset U with fourth node of subset V. Furthermore, in the bipartite graph there is no edge within the subsets. This means that in the bipartite graph the third nodes are not connected to one another by an edge. Furthermore, the fourth nodes in the bipartite graph are not connected to one another.
  • a smallest set of the fourth nodes, which are connected to all third nodes, is determined as a function of the bipartite graph. By determining the smallest number of fourth nodes, it is ensured in particular that every third node is covered by one of the fourth nodes.
  • a further fourth node can subsequently be constructed and implemented.
  • the graph database is generated, expanded and / or changed as a function of the smallest amount of the fourth nodes. In this case only the determined fourth nodes of the smallest amount are saved in the graph database. Any redundancies can advantageously be reduced in this way.
  • the mechatronic system includes a defective component and thus at least one malfunction, it will Malfunction represented by at least one fault memory entry.
  • the method is designed to expand and / or complete the graph database in the event that no fourth nodes or the set of fourth nodes are not sufficient to connect all third nodes to at least one of the fourth nodes.
  • an already existing graph database is expanded or changed accordingly depending on the smallest amount of the fourth nodes.
  • the generated, expanded and / or modified graph database in this case comprises a first main level and a second main level.
  • the first main level further comprises a first sub-level and a second sub-level.
  • the first nodes are located in the first sub-level.
  • the second nodes for example, are located in the second sub-level.
  • the first nodes and the second nodes are connected to the first directed edges. At least a subset of the first directed edges can be directed from the first subplane to the second subplane and the remaining subset of the first edges can be directed from the second subplane to the first subplane.
  • the second main level comprises, for example, a third sub-level and a fourth sub-level.
  • the third nodes are arranged, for example, in the third sub-level and the fourth nodes are arranged in the fourth sub-level.
  • the directed second edges are, for example, from the second partial plane in the direction of third sub-level directed.
  • the third edges are directed, for example, from the third sub-plane to the fourth sub-plane.
  • the determination of the smallest set of the fourth nodes is determined by a predefined set coverage problem algorithm.
  • the smallest number of the fourth nodes is determined, for example, after the bipartite graph has been generated.
  • the specified set cover problem algorithm is, for example, a weighted set cover problem algorithm and / or a geometric set cover problem algorithm.
  • the smallest quantity of the fourth nodes is determined as a function of a weight, for example.
  • every fourth node can comprise several attributes which are representative of the weighting.
  • the attribute is dependent on a robustness value of the respective fourth node.
  • the smallest quantity of the fourth nodes becomes, for example, depending on an activity of the third and fourth nodes determined.
  • every third and fourth node can comprise several attributes which are representative of the framework conditions of the respective activity.
  • the attribute is dependent on the activity during a point in time or a period of time or dependent on other system states. If the third node and the fourth node are active at different times, the smallest number of the fourth nodes is determined depending on the activity of the third node and the fourth node. This advantageously ensures, in particular, that the third nodes are covered by one of the fourth nodes at all times.
  • the third nodes and the fourth nodes are represented in a relational table as a function of the bipartite graph.
  • the relational table indicates how the third node and the fourth node are connected by the further third edges.
  • the graph database is determined, expanded and / or changed as a function of the relational table.
  • a subset of fourth nodes via reducts and a core of the reducts are determined as a function of the relational table.
  • Reductions are subsets of an original set of features that have the same expressiveness as the original set.
  • the core of the reducts is an intersection of all possible reducts and thus a non-exchangeable portion of the reduct.
  • the proportion of the fourth nodes that are to be assigned to the core is determined in the relational table.
  • the remaining features in the reduct are selected using a linear optimization problem. For example, the remaining features are selected as a function of the attributes of the fourth nodes that are to be assigned to the weighting.
  • a third node can thus be clearly identified as a function of the fourth node by combining the theory of quantity coverage and the reducts occurring in the rough set theory.
  • the second nodes and the third nodes are arranged hierarchically.
  • the second nodes and the third nodes are preferably ordered hierarchically before the bipartite graph is generated.
  • the second nodes are hierarchically ordered as a function of the attributes assigned to the second nodes.
  • the second nodes whose attributes are characteristic of the coarse-grained level, are arranged at the top.
  • the second nodes are arranged in descending order, the attributes of which are each characteristic of the fine-grained level. This means that an arrangement of equivalence classes of the second nodes is dependent on the granularity of the second nodes.
  • the third nodes are hierarchically subordinate to the second nodes.
  • one or more fourth nodes are assigned to the second node and the third node in the hierarchical arrangement.
  • the bipartite graph is generated as a function of the hierarchical arrangement.
  • the further third edges between the third node and the fourth node of the bipartite graph are determined using an accessibility analysis algorithm as a function of the hierarchical arrangement.
  • the first nodes are each representative of at least one component and / or at least one part of the mechatronic system.
  • the second nodes are each representative of at least one function of a component assigned to the function and / or of a component assigned to the function.
  • At least one of the first nodes in the graph database is connected to at least one of the second nodes with one of the first directed edges.
  • the first directed edge is representative of one Interrelationship between the first node and the second node.
  • the third nodes are each representative of at least one malfunction of a function assigned to the malfunction.
  • At least one of the second nodes in the graph database is connected to one of the third nodes with one of the second directed edges.
  • the second directed edge is representative of an operative relationship between the second node and the third node.
  • the fourth nodes are each representative of at least one fault memory entry from a malfunction assigned to the fault memory entry.
  • the fault memory entry can be a result of a diagnostic function, for example.
  • the fault memory entry is, for example, a code number for identifying malfunctions, for example a Diagnostic Trouble Code (“DTC” for short), a result of an offboard test module and / or at least a customer observation.
  • DTC Diagnostic Trouble Code
  • At least one of the third nodes is included in the graph database one of the fourth nodes connected to one of the third directed edges.
  • a graph database is preferably generated, expanded and / or changed, with which an optimized scope of diagnosis is generated, which safeguards all known malfunctions of a component.
  • Such a graph database that can be generated is optimized in particular with regard to a scope of diagnosis, a diagnosis time window, diagnosis functionality and / or costs.
  • the scope of diagnosis includes, for example, legally relevant deviations and / or deviations that would restrict customer-relevant functions.
  • the diagnosis time window contains, for example, a duration to carry out the diagnosis function and / or in which operating situation the functionality to be considered is available.
  • the diagnostic functionality includes, for example, the type of diagnostic function that is dependent, for example, on the respective functionality to be considered and its possible malfunctions. This also includes a granularity of the diagnostic function and / or a robustness of the diagnostic function.
  • the costs can include, on the one hand, through the application of the diagnoses and, on the other hand, through foreseeable costs in the case of non-application of a diagnosis through the implementation of any additional off-board test modules that may be required.
  • a device for generating a graph database for determining the scope of diagnosis for possible errors in at least one component of a mechatronic system is specified.
  • the device is designed to carry out the method described here. All features of the embodiment disclosed in connection with the method are therefore also disclosed in connection with the device and vice versa.
  • a vehicle is specified that has the device described here.
  • the vehicle is in particular a motor vehicle.
  • a computer program comprising instructions which, when the computer program is executed by a computer, cause the computer to carry out the method described here.
  • a computer-readable storage medium is specified on which the computer program described here is stored.
  • Figure 1 flow diagram of a method according to a
  • Figure 2 is a schematic representation of a device and a vehicle according to an embodiment
  • FIGS. 3 and 4 show examples of graphs from FIG.
  • FIG. 5 shows an example of a hierarchy of nodes and a bipartite graph
  • FIG. 6 exemplary representation of a relational table
  • FIG. 7 representation of a graph database according to an exemplary embodiment.
  • a method step S1 is first carried out, in which the first node K1, second node K2, third node K3 and fourth node K4 are provided. At least some of the first and / or the second and / or the third and / or the fourth nodes Kl, K2, K3, K4 are connected to one another in this exemplary embodiment by directed first edges El, directed second edges E2 and directed third edges E3.
  • the first nodes K1 are each representative of at least one component 3 and / or at least one component 2 of a mechatronic system 4.
  • the second nodes K2 are each representative of at least one function of one of the A component 3 assigned to the function and / or a component 2 assigned to the function.
  • the third nodes K3 are each representative of at least one malfunction of a function assigned to the malfunction and the fourth nodes K4 are each representative of at least one fault memory entry from a malfunction assigned to the fault memory entry .
  • the fault memory entry is, for example, a DTC.
  • At least some of the first nodes Kl are connected to at least some of the second nodes K2 by directed first edges El
  • at least some of the second nodes K2 are connected to at least some of the third nodes K3 and at least some of the third nodes by directed second edges E2 K3 are connected to at least some of the fourth nodes K4 by directed third edges E3.
  • the second nodes K2 and the third nodes K3 are arranged hierarchically, as also explained in more detail in connection with FIG. 5, for example.
  • the hierarchical arrangement of the second nodes K2 corresponds to a hierarchy of the functions of the components 3 and / or parts 2. Functions that are representative of a coarse-grained level of the mechatronic system 4 are arranged at the top. The functions that are characteristic of the fine-grained level of the mechatronic system 4 are arranged in descending order.
  • the third nodes K3 are hierarchically subordinate to the second node K2.
  • the fourth nodes K4, which are connected to the second node K2 and / or the third node K3, are hierarchically subordinate to the third node K3.
  • a bipartite graph is subsequently generated as a function of the third and fourth nodes K4 provided, in particular as a function of the hierarchical arrangement and an availability analysis, as is also explained in more detail in connection with FIG. 5, for example.
  • the third nodes K3 and the fourth nodes K4 are each connected to one another by further third directed edges E4.
  • the generated bipartite graph comprises the third nodes K3 and the fourth nodes K4, which are each part of an independent subset. In the generated bipartite graph there is no edge within these subsets.
  • a smallest set of the fourth nodes K4, which are connected to all third nodes K3, is determined as a function of the bipartite graph.
  • the smallest amount of the fourth nodes K4 is determined by a weighted and / or a geometric amount coverage problem algorithm.
  • a graph database 1 can be used as a function of the smallest Set of fourth nodes K4 can be generated, expanded and / or changed.
  • the vehicle 6 according to the exemplary embodiment in FIG. 2 comprises a device 5.
  • the device 5 is designed to carry out the method described here.
  • the device 5 can be part of the vehicle 6.
  • the external device is not part of the vehicle 6 in this case. It is also possible for the device 5 to be part of the vehicle 6 and part of the external device.
  • the vehicle 6 is a motor vehicle.
  • the vehicle 6 furthermore comprises at least one component 3 and at least one component 2.
  • a graph with a first node K1 and a second node K2 is shown on the left-hand side.
  • the first node K1 and the second node K2 are connected to one another by first edges E1.
  • Such a graph is representative of a mode of operation of a mechatronic system 4.
  • the method described here allows fourth nodes K4 to be assigned to the second node K2.
  • Such a graph is shown on the right-hand side of FIG.
  • a graph with a first node K1, a second node K2 and a fourth node K4 is shown on the left-hand side.
  • the first node K1 and the second node K2 are connected to one another by first edges E1.
  • the second nodes K2 have third edges E3 connected to the fourth node K4.
  • Such a graph is also representative of a mode of operation of a mechatronic system 4, with all possible error memory entries also being listed.
  • the method described here allows fourth nodes K4 to be assigned to the second node K2, with the redundancies of the fourth node K4 being reduced.
  • Such a graph is shown on the right-hand side of FIG.
  • a corresponding graph can be optimized in particular by the method according to FIG. to be added.
  • the second node K2 at the top in the hierarchical arrangement according to FIG. 5, left side, is, for example, representative of a function of a component 3 of a subsystem of a mechatronic system 4.
  • the downstream second nodes K2 are, for example, each representative of a function of a component 2 of component 3 of the subsystem of the mechatronic system 4.
  • the third nodes K3 are arranged downstream of the second node K2.
  • a fourth node K4 is assigned to each of these second nodes K2 and third node K3.
  • a bipartite graph is then determined as a function of the hierarchical arrangement, as shown on the right-hand side of FIG.
  • the bipartite graph includes only those third node K3 and the fourth node K4.
  • the third nodes K3 and the fourth nodes K4 are connected to one another by further third edges E4.
  • the attributes of the further third edges E4 are each dependent on the attributes of the edges along a path from one of the fourth nodes K4 to one of the third nodes K3.
  • the paths here correspond to the paths along the edges in the hierarchical arrangement.
  • the third nodes K3 and the fourth nodes K4 are shown as a function of the bipartite graph in a relational table. In this way, reductions can advantageously be determined. A uniqueness of a malfunction via the error memory entries can in particular be ensured in this case via these reductions.
  • a portion of the error memory entries ie the fourth node K4, which are to be assigned to a core, is first identified. According to FIG. 6, these are K4i, K4 3 and K4s.
  • a remaining part, also called the variable part, of the reducts is selected using a linear optimization problem algorithm. This remaining proportion of the reducts is determined from K4 2 and K4 4 in FIG. 6.
  • the generated graph database 1 comprises a first main level H1 and a second main level H2.
  • the first main level Hl further comprises a first sub-level TI and a second sub-level T2.
  • the first node Kl is localized in the first sub-level TI.
  • the second nodes K2 are located in the second sub-level T2.
  • the first node Kl and the second node K2 are with the first directed edges El connected. At least a subset of the first directed edges El can be directed from the first subplane TI to the second subplane T2 and the remaining subset of the first edges El can be directed from the second subplane T2 to the first subplane TI.
  • the second main level H2 comprises a third sub-level T3 and a fourth sub-level T4.
  • the second main level H2 is the error level of the graph database 1.
  • the third nodes K3 are arranged in the third sub-level T3 and the fourth nodes K4 are arranged in the fourth sub-level T4.
  • the directed second edges E2 are directed from the second partial plane T2 in the direction of the third partial plane T3.
  • the third edges E3 are directed from the third sub-plane T3 to the fourth sub-plane T4.
  • the fourth nodes K4 are in particular optimized according to the method described here.
  • Such a graph database 1 advantageously ensures in particular that all third nodes K3 are covered by at least one of the fourth nodes K4.
  • such a graph database 1 advantageously ensures in particular that a third node K3 is covered by one of the fourth nodes K4 at any point in time.
  • such a method can in particular ensure that a third node K3 can be uniquely identified via a set of connected fourth nodes K4. List of reference symbols

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé pour générer une base de données orientée graphe (1) pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie (2) d'un système mécatronique (4), comprenant les étapes suivantes : la fourniture de premiers nœuds (K1), de deuxièmes nœuds (K2), de troisièmes nœuds (K3) et de quatrièmes nœuds (K4), au moins certains des premiers nœuds (K1) étant reliés à au moins certains des deuxièmes nœuds (K2) par l'intermédiaire de premiers bords orientés (E1), au moins certains des deuxièmes nœuds (K2) étant reliés à au moins certains des troisièmes nœuds (K3) par l'intermédiaire de deuxièmes bords orientés (E2), et au moins certains des troisièmes nœuds (K3) étant reliés à au moins certains des quatrièmes nœuds (K4) par l'intermédiaire de troisièmes bords orientés (E3); la génération d'un graphe bipartite selon les troisièmes et quatrièmes nœuds fournis (K3, K4), comprenant les troisièmes nœuds (K3) et les quatrièmes nœuds (K4), reliés les uns aux autres par d'autres troisièmes bords orientés (E4); la détermination d'un plus petit nombre des quatrièmes nœuds (K4) qui sont reliés à tous les troisièmes nœuds (K3) selon le graphe bipartite; et la génération de, l'ajout à, et/ou la modification de, la base de données orientée graphe (1) selon le plus petit nombre des quatrièmes nœuds (K4).
PCT/EP2021/054995 2020-04-27 2021-03-01 Procédé, dispositif, programme informatique et support d'enregistrement lisible par ordinateur pour générer une base de données orientée graphe pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie d'un système mécatronique WO2021219275A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102020111338.2 2020-04-27
DE102020111338.2A DE102020111338A1 (de) 2020-04-27 2020-04-27 Verfahren, Vorrichtung, Computerprogramm und computerlesbares Speichermedium zum Erzeugen einer Graphen-Datenbank zur Ermittlung eines Diagnoseumfangs für mögliche Fehler von zumindest einem Bauteil eines mechatronischen Systems

Publications (1)

Publication Number Publication Date
WO2021219275A1 true WO2021219275A1 (fr) 2021-11-04

Family

ID=74853637

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2021/054995 WO2021219275A1 (fr) 2020-04-27 2021-03-01 Procédé, dispositif, programme informatique et support d'enregistrement lisible par ordinateur pour générer une base de données orientée graphe pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie d'un système mécatronique

Country Status (2)

Country Link
DE (1) DE102020111338A1 (fr)
WO (1) WO2021219275A1 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19742448C1 (de) * 1997-09-26 1998-12-17 Daimler Benz Ag Diagnosemodul zum Erstellen einer Diagnose für elektrisch ansteuerbare Systeme und Diagnoseeinrichtung zum Erstellen einer Gesamtsystemdiagnose
DE102007010978A1 (de) * 2007-03-05 2008-09-11 Volkswagen Ag Verfahren und Vorrichtung zur Unterstützung einer Diagnose eines elektrischen Systems mittels wahrscheinlichkeitsbasierter Fehlerkandidatenermittlung
DE102007047421A1 (de) * 2007-10-04 2009-04-09 Robert Bosch Gmbh Verfahren zum Beschreiben eines Verhaltens einer technischen Einrichtung
EP2284631A1 (fr) * 2009-07-17 2011-02-16 Siemens Aktiengesellschaft Procédé de fonctionnement d'un système de diagnostic de véhicule, programme de commande et système de diagnostic de véhicule
DE102010004385A1 (de) * 2010-01-12 2011-07-14 Siemens Aktiengesellschaft, 80333 Verfahren und Vorrichtung zum automatischen Identifizieren von weiteren fehlerhaften Komponenten in einem Gerät
DE112019000972T5 (de) * 2018-04-30 2020-11-12 Robert Bosch Gmbh Verfahren und Systeme für vereinfachte grafische Abbildungen von bipartiten Graphen

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19742448C1 (de) * 1997-09-26 1998-12-17 Daimler Benz Ag Diagnosemodul zum Erstellen einer Diagnose für elektrisch ansteuerbare Systeme und Diagnoseeinrichtung zum Erstellen einer Gesamtsystemdiagnose
DE102007010978A1 (de) * 2007-03-05 2008-09-11 Volkswagen Ag Verfahren und Vorrichtung zur Unterstützung einer Diagnose eines elektrischen Systems mittels wahrscheinlichkeitsbasierter Fehlerkandidatenermittlung
DE102007047421A1 (de) * 2007-10-04 2009-04-09 Robert Bosch Gmbh Verfahren zum Beschreiben eines Verhaltens einer technischen Einrichtung
EP2284631A1 (fr) * 2009-07-17 2011-02-16 Siemens Aktiengesellschaft Procédé de fonctionnement d'un système de diagnostic de véhicule, programme de commande et système de diagnostic de véhicule
DE102010004385A1 (de) * 2010-01-12 2011-07-14 Siemens Aktiengesellschaft, 80333 Verfahren und Vorrichtung zum automatischen Identifizieren von weiteren fehlerhaften Komponenten in einem Gerät
DE112019000972T5 (de) * 2018-04-30 2020-11-12 Robert Bosch Gmbh Verfahren und Systeme für vereinfachte grafische Abbildungen von bipartiten Graphen

Also Published As

Publication number Publication date
DE102020111338A1 (de) 2021-10-28

Similar Documents

Publication Publication Date Title
EP1597643B1 (fr) Dispositif et procede de diagnostic embarque base sur un modele
DE69925000T2 (de) Fehlertolerantes elektronisches bremssystem
DE102009030774B4 (de) Verfahren zur rechnergestützten Erfassung von Fehlern beim Ablauf von einem oder mehreren softwarebasierten Programmen in einem System aus Komponenten
DE102018203374A1 (de) Fehlerbaumanalyse für technische Systeme
EP0966703B1 (fr) Procede d'analyse assistee par ordinateur de defaillances de capteurs et/ou d'actionneurs dans un systeme technique
WO2000073903A2 (fr) Procede et systeme pour determiner l'arborescence de defaillances d'un systeme technique, produit de programme informatique et support d'information lisible par ordinateur
EP1639465B1 (fr) Procede permettant de surveiller l'execution d'un programme dans un micro-ordinateur
DE102017218643A1 (de) Funktionsmodul, Steuereinheit für ein Betriebsassistenzsystem und Arbeitsvorrichtung
DE102017204745A1 (de) Architektur und Vorrichtung für eine fortschrittliche Arbitration in integrierten Steuerungen
DE202006003273U1 (de) Diagnosevorrichtung in einem Fahrzeug für eine funktionsorientierte Diagnose
WO2008014940A1 (fr) Dispositif de commande et procédé pour la commande de fonctions
WO2020249169A1 (fr) Procédé pour garantir ou maintenir la fonction d'un système global critique pour la sécurité
WO2021219275A1 (fr) Procédé, dispositif, programme informatique et support d'enregistrement lisible par ordinateur pour générer une base de données orientée graphe pour déterminer un champ de diagnostic pour des erreurs possibles dans au moins une partie d'un système mécatronique
WO2021219276A1 (fr) Procédé, dispositif, programme informatique et support de stockage lisible par ordinateur pour générer une base de données de graphes pour déterminer une partie à vérifier d'un système mécatronique
WO2005001692A2 (fr) Procede et dispositif pour la surveillance d'un systeme reparti
EP4091054A1 (fr) Procédé et dispositif pour reconfigurer un véhicule à conduite automatique en cas d'erreur
DE102020209228A1 (de) Verfahren zum Überwachen wenigstens einer Recheneinheit
WO2007065585A1 (fr) Procede et dispositif de diagnostic oriente fonction d'un systeme comportant des composants mis en reseau
DE102009027369A1 (de) Verfahren sowie System zur Ansteuerung von mindestens einem Aktuator
DE10332202A1 (de) Bayesnetz-basiertes Expertensystem zur Diagnose, Risikoanalyse und Funktions-Wiederherstellung, insbesondere bei Kraftfahrzeugen
DE10315344A1 (de) Verfahren und Vorrichtung zur Erkennung fehlerhafter Komponenten in Fahrzeugen
DE10359875A1 (de) Digitales Netzwerk für Kraftfahrzeuge
DE102017212560A1 (de) Verfahren zum ausfallsicheren Durchführen einer sicherheitsgerichteten Funktion
DE102005061386A1 (de) Verfahren zur Fehlerdiagnose
DE10213895A1 (de) Diagnosemodul

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21709377

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21709377

Country of ref document: EP

Kind code of ref document: A1