Method and system for generating minimal cut-sets for highly integrated large systems

An apparatus (1200) comprising processing circuitry (1202) and a memory (1204) storing computer-readable program code (1206) that, in response to execution by the processing circuitry (1202), cause the apparatus (1200) to at least:

• receive a system model (102) and a scenario (104), the system model being for a manufactured system composed of a plurality of components (200);
• obtain a dependency array (300) from the system model (102) according to the scenario, the dependency array (300) comprising at least one case (302);
• select a case (302) in the dependency array (300);
• execute a pre-computation step including:
• identify re-occurring clusters of components (900) in the dependency array (300) and utilize the re-occurring clusters of components (900) in cut-set combining operations to determine cut-sets for components (200) in the re-occurring clusters of components (900), and store said cut-sets in the cut-set repository (110) for later reuse, and
• determine cut-sets for components (200) to be stored in the cut-set repository (110) based on a number of occurrences of the components (200) across multiple dependency arrays of the system model (102), and store said cut-sets in the cut-set repository (110) for later reuse;
• query a cut-set repository (110) to determine if a cut-set for a component (200) of the plurality of components (200) in the case (302) is already stored, and retrieve said cut-set;
• if a cut-set is not stored, generate the minimal cut-set for the component (200) or the re-occurring clusters of components (900);
• compute a final cut-set list (112) by expanding the dependency array (300) using the cut-set for the component (200) or the re-occurring clusters of components (900);
• and
• perform a pre-production, production or post-production operation with respect to the manufactured system based on the final cut-set list.

A computer-readable storage medium (1204) that is non-transitory and has computer-readable program code (1206) stored therein that in response to execution by a processor (1202), cause an apparatus (1200) to at least:

• receive a system model (102) and a scenario (104), the system model being for a manufactured system composed of a plurality of components (200);
• obtain a dependency array (300) from the system model (102) according to the scenario, the dependency array (300) comprising at least one case (302);
• select a case (302) in the dependency array (300),
• execute a pre-computation step including:
• identify re-occurring clusters of components (900) in the dependency array (300) and utilize the re-occurring clusters of components (900) in cut-set combining operations to determine cut-sets for components (200) in the re-occurring clusters of components (900), and store said cut-sets in the cut-set repository (110) for later reuse, and
• determine cut-sets for components (200) to be stored in the cut-set repository (110) based on a number of occurrences of the components (200) across multiple dependency arrays of the system model (102), and store said cut-sets in the cut-set repository (110) for later reuse;
• query a cut-set repository (110) to determine if a cut-set for a component (200) of the plurality of components (200) in the case (302) is already stored, and retrieve said cut-set;
• if a cut-set is not stored, generate the minimal cut-set for the component (200) or the re-occurring clusters of components (900);
• compute a final cut-set list (112) by expanding the dependency array (300) using the cut-set for the component (200) or the re-occurring clusters of components (900);
• and
• perform a pre-production, production or post-production operation with respect to the manufactured system based on the final cut-set list.