Nuclear power accident information processing method and device

Abstract

The invention discloses a nuclear power accident information processing method and device, and the method comprises the steps: obtaining N pieces of nuclear power accident information corresponding to a target nuclear power accident final state, and each piece of nuclear power accident information comprises an originating event and a function event; obtaining fault tree information corresponding to each piece of nuclear power accident information according to each piece of nuclear power accident information; calling a plurality of working nodes to carry out parallel processing on the N pieces of fault tree information to obtain a minimum cut set corresponding to each piece of fault tree information; and combining the obtained minimum cut sets corresponding to the multiple pieces of fault tree information to obtain a global minimum cut set of the target nuclear power accident final state, in the steps, parallel independent calculation of the nuclear power accident information can be performed, the overall efficiency is improved, the local minimum cut sets obtained through distributed calculation are efficiently combined, the global minimum cut set is generated, and the overall efficiency of the target nuclear power accident final state is improved. The required set can be quickly obtained, and subsequent safety evaluation is facilitated.

Description

Technical Field

[0001] This application belongs to the field of information processing technology, and in particular relates to a method and apparatus for processing nuclear power plant accident information. Background Technology

[0002] In nuclear power plant safety risk assessment, probabilistic safety analysis (PSA) is a core technical approach, with the mainstream modeling path being the combined event tree (ET) and fault tree (FT) method. By using event trees to identify possible sequences of accidents, and then using fault trees to refine the failure logic of equipment or systems in each sequence, the final quantitative analysis outputs the nuclear power plant risk assessment results. This provides crucial information for nuclear power plant design optimization, operation and maintenance, and risk decision-making, serving as a vital support for ensuring nuclear safety.

[0003] Based on the "ET-FT" joint modeling structure, the scattered event tree branches and corresponding fault trees are integrated into a single large fault tree through a logical transformation algorithm. Then, the fault tree calculation engine of the PSA software is called to perform quantitative calculations on the integrated large fault tree in combination with basic data such as equipment failure probability and accident handling strategies, and finally output the overall risk assessment conclusion of the nuclear power plant.

[0004] The above method has high computational complexity, and the converted single fault tree contains thousands to tens of thousands of logic gates and basic events, resulting in low processing efficiency. Summary of the Invention

[0005] This application provides a method and apparatus for processing nuclear power accident information, which can perform parallel and independent calculations of nuclear power accident information, improve overall efficiency, and efficiently merge the local minimum cut sets obtained by distributed computing to generate a global minimum cut set, which can quickly obtain the required set and facilitate subsequent safety assessment.

[0006] In a first aspect, embodiments of this application provide a method for processing nuclear power plant accident information, the method comprising: Obtain N nuclear power accident information corresponding to the final state of the target nuclear power accident. Each nuclear power accident information includes an initiating event and a functional event. N is a positive integer and is greater than or equal to 2. Based on each nuclear power accident information, fault tree information corresponding to each nuclear power accident information is obtained. Each fault tree information includes basic events, intermediate events, top events, and the connection relationships between each event. Multiple worker nodes are invoked to process N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information. The minimum cut set is the smallest set of basic events that cause the top event to occur. The minimum cut sets corresponding to the multiple fault tree information obtained are merged to obtain the global minimum cut set of the final state of the target nuclear power accident.

[0007] In one embodiment of this application, merging the minimum cut sets corresponding to the acquired multiple fault tree information to obtain the global minimum cut set of the final state of the target nuclear power accident includes: The minimum cut sets corresponding to the multiple fault tree information obtained are merged to obtain a first set, and each minimum cut set is a first subset of the first set; If it is determined that there are duplicate subsets in multiple first subsets, the multiple first subsets are deduplicated to obtain a second set. The second set includes multiple second subsets, and any two second subsets contain different basic events. If the second set satisfies the preset filtering conditions, multiple second subsets in the second set are filtered to obtain the global minimum cut set.

[0008] In one embodiment of this application, the repeating subset is determined as follows: For each of the first subsets, the identifiers of the basic events in the first subset are sorted in ascending order to obtain sorted identifiers, and a hash value corresponding to the first subset is generated based on the sorted identifiers. If the same hash value exists among the hash values ​​corresponding to multiple first subsets, it is determined that there is a duplicate subset among the multiple first subsets.

[0009] In one embodiment of this application, the step of filtering multiple second subsets in the second set to obtain the global minimum cut set includes: For each of the second subsets, if the number of basic events in the second subset is greater than a preset number, the second subset is marked as a subset to be deleted; The global minimum cut set is obtained by deleting the second subsets marked as subsets to be deleted from the multiple second subsets.

[0010] In one embodiment of this application, the step of filtering multiple second subsets in the second set to obtain the global minimum cut set includes: For each of the second subsets, if the failure probability of the second subset is less than a preset probability, the second subset is marked as a subset to be deleted; The global minimum cut set is obtained by deleting the second subsets marked as subsets to be deleted from the multiple second subsets.

[0011] In one embodiment of this application, obtaining fault tree information corresponding to each nuclear power accident based on each nuclear power accident information includes: For each nuclear power accident information, the initiating event and functional event in the nuclear power accident information are regarded as intermediate events; By connecting the intermediate events, basic events, and top event using logic gates, a fault tree is obtained; First information of the intermediate event is obtained, and the first information is associated with the fault tree to obtain fault tree information. The first information is the sub-fault tree or the corresponding basic event of the intermediate event.

[0012] In one embodiment of this application, the plurality of working nodes are communicatively connected to the master node; The process of calling multiple worker nodes to process N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information includes: The master node determines the working node from multiple connected nodes, and the working node is in an idle state. When the number of working nodes is greater than or equal to N, the master node distributes the N fault tree information to the N working nodes, and each working node uses a preset algorithm to generate the minimum cut set corresponding to the fault tree information based on the fault tree information; or, When the number of working nodes is less than N, the master node divides the N fault tree information into tasks to obtain M subtasks, and the master node assigns the M subtasks to the working nodes. M is a positive integer and the number of working nodes is the same. Each working node is assigned one subtask, and each subtask includes at least one fault tree information.

[0013] In one embodiment of this application, before obtaining N nuclear power accident information corresponding to the final state of the target nuclear power accident, the method further includes: In response to accident analysis commands, multiple nuclear power accident final state indicators are displayed; In response to the selection operation for the nuclear power accident final state identifier, the nuclear power accident final state identified by the selected nuclear power accident final state identifier is taken as the target nuclear power accident final state.

[0014] Secondly, embodiments of this application provide a nuclear power accident information processing device, the device comprising: The acquisition module is used to acquire N nuclear power accident information corresponding to the final state of the target nuclear power accident. Each nuclear power accident information includes an initiation event and a functional event, where N is a positive integer. The first processing module is used to obtain fault tree information corresponding to each nuclear power accident information based on each nuclear power accident information. Each fault tree information includes basic events, intermediate events, top events, and the connection relationships between each event. The calling module is used to call multiple working nodes to process N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information, wherein the minimum cut set is the smallest set of basic events that cause the top event to occur. The second processing module is used to merge the minimum cut sets corresponding to the multiple fault tree information obtained to obtain the global minimum cut set of the final state of the target nuclear power accident.

[0015] In one embodiment of this application, the second processing module includes: a merging submodule, a deduplication submodule, and a filtering submodule; The merging submodule is used to merge the minimum cut sets corresponding to the multiple fault tree information obtained to obtain a first set, and each minimum cut set is a first subset in the first set; The deduplication submodule is used to deduplicatize multiple first subsets when it is determined that there are duplicate subsets in multiple first subsets, to obtain a second set. The second set includes multiple second subsets, and any two second subsets include different basic events. The filtering submodule is used to filter multiple subsets of the second set in the second set when the second set meets the preset filtering conditions, so as to obtain the global minimum cut set.

[0016] Thirdly, embodiments of this application provide an electronic device, including: a processor and a memory storing computer program instructions; When the processor executes the computer program instructions, it implements the nuclear power accident information processing method as described in the first aspect.

[0017] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer program instructions, which, when executed by a processor, implement the nuclear power accident information processing method as described in the first aspect.

[0018] Fifthly, embodiments of this application provide a computer program product in which instructions, when executed by a processor of an electronic device, cause the electronic device to perform the nuclear power accident information processing method as described in the first aspect.

[0019] This application provides a method and apparatus for processing nuclear power accident information. The method involves acquiring N nuclear power accident information points corresponding to the final state of a target nuclear power accident. Each nuclear power accident information point includes an initiating event and a functional event, where N is a positive integer and greater than or equal to 2. Based on each nuclear power accident information point, fault tree information corresponding to each nuclear power accident information point is obtained. Each fault tree information point includes basic events, intermediate events, a top event, and the connection relationships between these events. Multiple working nodes are invoked to process the N fault tree information points in parallel, obtaining a minimum cut set corresponding to each fault tree information point. The minimum cut set is the smallest set of basic events that leads to the occurrence of the top event. The minimum cut sets corresponding to the acquired multiple fault tree information points are merged to obtain the global minimum cut set of the final state of the target nuclear power accident. In the above steps, parallel and independent computation of nuclear power accident information can be performed, improving overall efficiency. Furthermore, the efficient merging of local minimum cut sets obtained from distributed computation to generate a global minimum cut set allows for rapid acquisition of the required set, facilitating subsequent safety assessments. Attached Figure Description

[0020] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the embodiments of this application will be briefly introduced below. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a flowchart illustrating a nuclear power accident information processing method provided in an embodiment of this application; Figure 2 This is a schematic diagram of nodes provided in an embodiment of this application; Figure 3 This is a schematic diagram of the structure of the nuclear power accident information processing device provided in the embodiments of this application; Figure 4 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application. Detailed Implementation

[0022] The features and exemplary embodiments of various aspects of this application will be described in detail below. To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain this application and not to limit it. For those skilled in the art, this application can be implemented without some of these specific details. The following description of the embodiments is merely to provide a better understanding of this application by illustrating examples.

[0023] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising..." does not exclude the presence of additional identical elements in the process, method, article, or apparatus that includes said element.

[0024] To address the problems of the prior art, this application provides a method and apparatus for processing nuclear power plant accident information. The method for processing nuclear power plant accident information provided in this application will be described first.

[0025] Figure 1 A flowchart illustrating a nuclear power plant accident information processing method according to an embodiment of this application is shown. Figure 1 As shown, the nuclear power accident information processing method provided in this application embodiment is applied to electronic devices, such as servers, and includes the following steps 101-105, wherein: Step 101: Obtain N nuclear power accident information corresponding to the final state of the target nuclear power accident. Each nuclear power accident information includes an initiating event and a functional event. N is a positive integer and is greater than or equal to 2.

[0026] In this embodiment, the final state of a nuclear power accident refers to the stable state of the system from the occurrence and development of the accident to its final termination; it is the final result after the impact of the accident has completely ceased. The target nuclear power accident final state is the object to be analyzed and can be specified by the user from multiple nuclear power accident final states. N nuclear power accident information corresponding to the target nuclear power accident final state are obtained. The nuclear power accident information can be an accident sequence, which is the final representation of the event tree branch structure. Each accident sequence completely reflects the evolution process of a certain branch of the event tree. Each nuclear power accident information includes an initiating event and a functional event, where N is a positive integer and N is greater than or equal to 2. The initiating event is an event that may cause disturbance to the nuclear power plant and may lead to unacceptable consequences, such as loss of external power or a primary loop pipeline rupture. Functional events refer to related system function failures / personnel intervention events used to mitigate the initiating event, such as power restoration or water replenishment.

[0027] Step 102: Based on each nuclear power accident information, obtain the fault tree information corresponding to each nuclear power accident information. Each fault tree information includes basic events, intermediate events, top events, and the connection relationships between each event.

[0028] In this embodiment, a fault tree is constructed based on each nuclear power accident information to obtain the fault tree corresponding to each nuclear power accident information. Each fault tree information includes the connection relationship between basic events, intermediate events, and top events, with the final state of the target nuclear power accident as the top event.

[0029] In Fault Tree Analysis (FTA), the top event represents the most undesirable failure or in-depth analysis of the system's consequences. It serves as the starting point and objective for the entire fault tree. The top event must be decomposed into lower-level events (intermediate or basic events) using logic gates (AND or OR gates). Intermediate events, located between the top and basic events, represent failure states caused by the combined effects of lower-level events (intermediate or basic events) and can be further decomposed. They act as a bridge connecting top-level consequences and bottom-level causes. Basic events are the lowest-level events in the fault tree, representing the fundamental causes that cannot or do not require further decomposition and lead to the occurrence of higher-level events. They are the endpoint of the fault tree analysis.

[0030] Step 103: Call multiple working nodes to process the N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information. The minimum cut set is the smallest set of basic events that cause the top event to occur.

[0031] In this embodiment, multiple worker nodes are invoked to process N fault tree information in parallel. Each worker node generates the minimum cut set corresponding to the fault tree information based on the assigned fault tree information. The minimum cut set is the smallest set of basic events that cause the top event to occur. When all basic events occur simultaneously, the top event will necessarily occur. If any one of them is missing, the top event will not occur.

[0032] Step 104: Merge the minimum cut sets corresponding to the multiple fault tree information obtained to obtain the global minimum cut set of the final state of the target nuclear power accident.

[0033] In this embodiment, through distributed computing, the minimum cut sets corresponding to multiple fault trees are obtained. The obtained minimum cut sets corresponding to multiple fault trees are merged to obtain the global minimum cut set of the final state of the target nuclear power accident.

[0034] In this embodiment, N nuclear power accident information corresponding to the final state of the target nuclear power accident are obtained. Each nuclear power accident information includes an initiating event and a functional event, where N is a positive integer and is greater than or equal to 2. Based on each nuclear power accident information, fault tree information corresponding to each nuclear power accident information is obtained. Each fault tree information includes basic events, intermediate events, a top event, and the connection relationships between the events. Multiple working nodes are invoked to process the N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information. The minimum cut set is the smallest set of basic events that leads to the occurrence of the top event. The minimum cut sets corresponding to the multiple fault tree information are merged to obtain the global minimum cut set of the final state of the target nuclear power accident. In the above steps, the nuclear power accident information can be calculated independently in parallel, improving the overall efficiency. The local minimum cut sets obtained by distributed computing are merged efficiently to generate the global minimum cut set, which can quickly obtain the required set and facilitate subsequent safety evaluation.

[0035] In one embodiment of this application, merging the minimum cut sets corresponding to the acquired multiple fault tree information to obtain the global minimum cut set of the final state of the target nuclear power accident includes: The minimum cut sets corresponding to the multiple fault tree information obtained are merged to obtain a first set, and each minimum cut set is a first subset of the first set; If it is determined that there are duplicate subsets in multiple first subsets, the multiple first subsets are deduplicated to obtain a second set. The second set includes multiple second subsets, and any two second subsets contain different basic events. If the second set satisfies the preset filtering conditions, multiple second subsets in the second set are filtered to obtain the global minimum cut set.

[0036] In this embodiment, the minimum cut sets corresponding to the acquired multiple fault tree information are merged to obtain a first set, where each minimum cut set is a first subset within the first set. It is then determined whether duplicate subsets exist within the multiple first subsets. A duplicate subset is defined as two or more first subsets containing the same basic events; different fault information may have minimum cut sets containing the same basic events. If duplicate subsets are found within the multiple first subsets, deduplication is performed to remove duplicate subsets, resulting in a second set. The second set includes multiple second subsets, where no two subsets contain the same basic events.

[0037] Furthermore, it is determined whether the second set meets the preset filtering conditions. If the second set meets the preset filtering conditions, multiple second subsets in the second set are filtered to obtain the global minimum cut set. If the second set does not meet the preset filtering conditions, the second set is taken as the global minimum cut set. The purpose of filtering is to remove duplicate and redundant data to facilitate subsequent analysis.

[0038] Duplicate data is deduplicated by removing duplicate minimal cut sets to avoid the same risk path appearing multiple times in the global results, thus reducing the workload of storing, transmitting, and analyzing redundant data.

[0039] In one embodiment of this application, the repeating subset is determined as follows: For each of the first subsets, the identifiers of the basic events in the first subset are sorted in ascending order to obtain sorted identifiers, and a hash value corresponding to the first subset is generated based on the sorted identifiers. If the same hash value exists among the hash values ​​corresponding to multiple first subsets, it is determined that there is a duplicate subset among the multiple first subsets.

[0040] In this embodiment, for each first subset, the identifiers of the basic events in the first subset are sorted, with the same basic event corresponding to the same identifier, to obtain the sorted identifiers, and the hash value corresponding to the first subset is generated based on the sorted identifiers.

[0041] If the same hash value exists among the hash values ​​corresponding to multiple first subsets, it indicates that two or more subsets include the same basic events, thus determining that there are duplicate subsets among multiple first subsets.

[0042] Hash values ​​can transform complex cutsets, such as event combinations {A, B, C}, into fixed-length strings. Comparing two hash values ​​for consistency is much faster than comparing cutset content element by element, significantly reducing deduplication time. The probability of different cutsets producing the same hash value is extremely low, allowing for accurate determination of whether cutsets are truly duplicated, avoiding biased results due to misjudgments.

[0043] In one embodiment of this application, the step of filtering multiple second subsets in the second set to obtain the global minimum cut set includes: For each of the second subsets, if the number of basic events in the second subset is greater than a preset number, the second subset is marked as a subset to be deleted; The global minimum cut set is obtained by deleting the second subsets marked as subsets to be deleted from the multiple second subsets.

[0044] In this embodiment, for each second subset, the number of basic events in the second subset is compared with a preset number. If the number of basic events in the second subset is greater than the preset number, the second subset is marked as a subset to be deleted. For example, the preset number can be set to 10. Subsets with more than 10 basic events are marked as subsets to be deleted. The probability of occurrence of basic events is usually a decimal, such as the probability of device failure, which is often 10. -5 ~10 -3 On a scale of 10 or more basic events, a cut set must occur simultaneously to trigger it. Its joint probability is the product of the probabilities of each event, and the value will be extremely low, such as 10 probabilities of 10. -4 The probability of a combination of events is only 10. -40 This is far below the acceptable risk threshold for nuclear power plants, so this part of the set can be disregarded.

[0045] Delete the subsets marked as pending deletion from multiple subsets, and use the deleted set as the global minimum cut set. If the number of basic events in a subset is less than or equal to a preset number, there is no need to delete that subset.

[0046] Reduce the number of cut sets that do not require attention, avoid excessive computing power consumption in the processing of massive amounts of data, and concentrate analysis resources on key cut sets, without wasting resources on cut sets with extremely low probability.

[0047] In one embodiment of this application, the step of filtering multiple second subsets in the second set to obtain the global minimum cut set includes: For each of the second subsets, if the failure probability of the second subset is less than a preset probability, the second subset is marked as a subset to be deleted; The global minimum cut set is obtained by deleting the second subsets marked as subsets to be deleted from the multiple second subsets.

[0048] In this embodiment, for each second subset, the failure probability of the second subset is compared with a preset probability. If the failure probability of the second subset is less than the preset failure probability, the second subset is marked as a subset to be deleted. The second subsets marked as subsets to be deleted from multiple second subsets are deleted, and the deleted set is used as the global minimum cut set.

[0049] Directly removing a large number of cut sets that exceed the threshold eliminates the need for probability calculations and contribution analysis, significantly reducing computational power consumption and analysis time.

[0050] In one embodiment of this application, obtaining fault tree information corresponding to each nuclear power accident based on each nuclear power accident information includes: For each nuclear power accident information, the initiating event and functional event in the nuclear power accident information are regarded as intermediate events; By connecting the intermediate events, basic events, and top event using logic gates, a fault tree is obtained; First information of the intermediate event is obtained, and the first information is associated with the fault tree to obtain fault tree information. The first information is the sub-fault tree or the corresponding basic event of the intermediate event.

[0051] In this embodiment, for each nuclear power accident information, the initiating event and functional event in the nuclear power accident information are taken as intermediate events. The intermediate events, basic events and top events are connected by logic gates to obtain a fault tree. The first information of the intermediate event is obtained. The first information is the sub-fault tree or the corresponding basic event of the intermediate event. The first information is associated with the fault tree to obtain fault tree information.

[0052] Furthermore, the constructed fault trees can be simplified by optimizing the structure of each fault tree based on Boolean rules to reduce computational load. The simplification rules employed include deletion and shrinkage rules. Deletion rules remove redundant logic gates, such as gates with the same input and output. Shrinkage rules merge hierarchical logic gates, simplifying the structure by shrinking multiple layers of AND gates directly into a single layer.

[0053] Fault trees transform accidents from unpredictable incidents into systemic problems that can be disassembled, analyzed, and controlled, making it easier to find the root cause and key risk points of accidents in a logical way.

[0054] In one embodiment of this application, the plurality of working nodes are communicatively connected to the master node; The process of calling multiple worker nodes to process N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information includes: The master node determines the working node from multiple connected nodes, and the working node is in an idle state. When the number of working nodes is greater than or equal to N, the master node distributes the N fault tree information to the N working nodes, and each working node uses a preset algorithm to generate the minimum cut set corresponding to the fault tree information based on the fault tree information; or, When the number of working nodes is less than N, the master node divides the N fault tree information into tasks to obtain M subtasks, and the master node assigns the M subtasks to the working nodes. M is a positive integer and the number of working nodes is the same. Each working node is assigned one subtask, and each subtask includes at least one fault tree information.

[0055] In this embodiment, multiple worker nodes are communicatively connected to a master node. The master node determines the worker nodes from the connected nodes. The worker nodes are in an idle state. When the number of worker nodes is greater than or equal to N, the master node distributes N fault tree information to N to N worker nodes. Each worker node uses a preset algorithm to generate the minimum cut set corresponding to the fault tree information based on the fault tree information. The minimum cut set is the smallest basic event set in which the top event occurs.

[0056] Alternatively, if the number of worker nodes is less than N, the master node divides the N fault tree information into M subtasks, and then the master node assigns the M subtasks to the worker nodes. M is a positive integer and the same as the number of worker nodes. For example, if there are 5 worker nodes and 10 fault data, the 10 fault data are divided into 5 subtasks, and the 5 subtasks are assigned to the 5 worker nodes. Each worker node is assigned one subtask, and each subtask includes 2 fault tree information.

[0057] The master node monitors the load of each node in real time, such as CPU utilization and remaining task load, to identify idle nodes. The master node ensures that the load of all nodes is balanced, thereby improving the overall computing efficiency.

[0058] The master node writes nuclear power accident information into the database and modifies the configuration information of the computation engine. This configuration includes the name of the top event to be calculated, its address in the database, and the address for outputting the results. The nuclear power accident information can be retrieved based on the address and name in the database. Each worker node is configured with a PSA software fault tree engine to ensure that each time a worker node calls the PSA software fault tree engine, it calculates a single fault tree structure. The engine configured on each worker node uses its built-in fault tree solving algorithm, such as the downlink method or the binary decision graph method, to generate a corresponding minimal cutset (MCSi) file from the database based on the nuclear power accident information. The minimal cutset file includes the identifiers of the basic events.

[0059] By splitting the incident sequence into independent, parallelizable subtasks, the limitations of serial computing are overcome.

[0060] Parallel task partitioning mechanism based on incident sequences: Tasks are split into independent, parallelizable subtasks according to the incident sequence, overcoming the limitations of serial computation. Dynamic load balancing technology: Through real-time monitoring and task scheduling, the load on computing nodes is balanced, maximizing resource utilization. Minimal cutset distributed merging algorithm: Combining hash deduplication and standardization, it efficiently generates a global minimal cutset without redundancy.

[0061] In one embodiment of this application, before obtaining N nuclear power accident information corresponding to the final state of the target nuclear power accident, the method further includes: In response to accident analysis commands, multiple nuclear power accident final state indicators are displayed; In response to the selection operation for the nuclear power accident final state identifier, the nuclear power accident final state identified by the selected nuclear power accident final state identifier is taken as the target nuclear power accident final state.

[0062] In this embodiment, in response to an accident analysis command, multiple nuclear power accident final state identifiers are displayed. These identifiers can be names, such as fuel damage (FD) and core damage (CD). The user can select one identifier. In response to the selection operation for a nuclear power accident final state identifier, the nuclear power accident final state identified by the selected identifier is taken as the target nuclear power accident final state. N nuclear power accident information corresponding to the target nuclear power accident final state is obtained, such as extracting the accident sequence. , , ,..., ,like Figure 2 As shown, the accident sequence is transmitted through the master node. , , ,..., Assigned to multiple worker nodes, and subsequently for each incident sequence When constructing a fault tree independently, the failure of the incident sequence is taken as the top event, and the initiating event and the related functional events are taken as intermediate events. These intermediate events are connected by an AND gate. At the same time, the fault tree or basic event (i.e., input) corresponding to the initiating event and each functional event is placed under the intermediate event that represents the initiating event and each functional event, respectively, and finally a small fault tree exclusive to the incident sequence is formed (hereinafter referred to as the incident sequence fault tree).

[0063] Users can select the final state they are most concerned about based on their own needs, so that subsequent risk analysis can revolve around this goal for accurate analysis.

[0064] Figure 3 A structural diagram of a nuclear power plant accident information processing device provided in an embodiment of this application is shown. Figure 3 As shown, the nuclear power accident information processing device 300 includes: The acquisition module is used to acquire N nuclear power accident information corresponding to the final state of the target nuclear power accident. Each nuclear power accident information includes an initiation event and a functional event, where N is a positive integer. The first processing module is used to obtain fault tree information corresponding to each nuclear power accident information based on each nuclear power accident information. Each fault tree information includes basic events, intermediate events, top events, and the connection relationships between each event. The calling module is used to call multiple working nodes to process N fault tree information in parallel to obtain the minimum cut set corresponding to each fault tree information, wherein the minimum cut set is the smallest set of basic events that cause the top event to occur. The second processing module is used to merge the minimum cut sets corresponding to the multiple fault tree information obtained to obtain the global minimum cut set of the final state of the target nuclear power accident.

[0065] In one embodiment of this application, the second processing module includes: a merging submodule, a deduplication submodule, and a filtering submodule; The merging submodule is used to merge the minimum cut sets corresponding to the multiple fault tree information obtained to obtain a first set, and each minimum cut set is a first subset in the first set; The deduplication submodule is used to deduplicatize multiple first subsets when it is determined that there are duplicate subsets in multiple first subsets, to obtain a second set. The second set includes multiple second subsets, and any two second subsets include different basic events. The filtering submodule is used to filter multiple subsets of the second set in the second set when the second set meets the preset filtering conditions, so as to obtain the global minimum cut set. In one embodiment of this application, the deduplication submodule includes a sorting subunit and a first determining subunit; The sorting subunit is used to sort the identifiers of basic events in the first subset from smallest to largest for each first subset, obtain the sorted identifier, and generate the hash value corresponding to the first subset based on the sorted identifier. If the same hash value exists among the hash values ​​corresponding to multiple first subsets, it is determined that there is a duplicate subset among the multiple first subsets.

[0066] In one embodiment of this application, the filtering submodule is specifically used to mark the second subset as a subset to be deleted if the number of basic events in the second subset is greater than a preset number; and to delete the second subsets marked as subsets to be deleted in multiple second subsets to obtain the global minimum cut set.

[0067] In one embodiment of this application, the filtering submodule is specifically used to mark each second subset as a subset to be deleted when the failure probability of the second subset is less than a preset probability; and to delete the second subsets marked as subsets to be deleted from multiple second subsets to obtain the global minimum cut set.

[0068] In one embodiment of this application, the first processing module includes a first processing submodule, a second processing submodule, and a third processing submodule; The first processing submodule is used to treat the initiating event and functional event in each nuclear power accident information as intermediate events. The second processing submodule is used to connect the intermediate events, basic events and top events through logic gates to obtain a fault tree; The third processing submodule is used to obtain the first information of the intermediate event and associate the first information with the fault tree to obtain fault tree information. The first information is the sub-fault tree or the corresponding basic event of the intermediate event.

[0069] In one embodiment of this application, multiple working nodes are communicatively connected to a master node; the invocation module includes a first determination submodule and an allocation submodule; The first determining submodule is used to determine a working node from multiple connected nodes through the master node, wherein the working node is in an idle state; The allocation submodule is used to allocate N fault tree information to N work nodes through the master node when the number of work nodes is greater than or equal to N, and each work node generates a minimum cut set corresponding to the fault tree information using a preset algorithm; or, when the number of work nodes is less than N, the master node divides the N fault tree information into tasks to obtain M subtasks, and allocates the M subtasks to the work nodes through the master node, where M is a positive integer and M is the same as the number of work nodes, and each work node is allocated one subtask, and each subtask includes at least one fault tree information.

[0070] In one embodiment of this application, the device includes a first response module and a second response module; The first response module is used to respond to accident analysis commands and display multiple nuclear power accident final state indicators; The second response module is used to respond to the selection operation of the nuclear power accident final state identifier, and to take the nuclear power accident final state identified by the selected nuclear power accident final state identifier as the target nuclear power accident final state.

[0071] The nuclear power accident information processing device provided in this application embodiment can realize the various processes implemented in the aforementioned nuclear power accident information processing method embodiment and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0072] Figure 4 A schematic diagram of the hardware structure of the electronic device provided in an embodiment of this application is shown.

[0073] The electronic device may include a processor 401 and a memory 402 storing computer program instructions.

[0074] Specifically, the processor 401 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this application.

[0075] Memory 402 may include mass storage for data or instructions. For example, and not limitingly, memory 402 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 402 may include removable or non-removable (or fixed) media. Where appropriate, memory 402 may be internal or external to the integrated gateway disaster recovery device. In a particular embodiment, memory 402 is non-volatile solid-state memory.

[0076] Memory may include read-only memory (ROM), random access memory (RAM), disk storage media devices, optical storage media devices, flash memory devices, and electrical, optical, or other physical / tangible memory storage devices. Therefore, typically, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to the first aspect of this disclosure.

[0077] The processor 401 implements any of the methods described above in the above embodiments by reading and executing computer program instructions stored in the memory 402.

[0078] In one example, the electronic device may also include a communication interface 403 and a bus 410. For example, Figure 4 As shown, the processor 401, memory 402, and communication interface 403 are connected through bus 410 and complete communication with each other.

[0079] The communication interface 403 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of this application.

[0080] Bus 410 includes hardware, software, or both, that couples components of a method or electronic device as described above together. For example, and not as a limitation, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 410 may include one or more buses. Although specific buses are described and illustrated in embodiments of this application, any suitable bus or interconnect is contemplated herein.

[0081] Alternatively, embodiments of this application can be implemented using a computer storage medium. This computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the nuclear power accident information processing methods described in the above embodiments.

[0082] Alternatively, this application embodiment can provide a computer program product for implementation, wherein when the instructions in the computer program product are executed by the processor of an electronic device, the electronic device implements any of the nuclear power accident information processing methods in the above embodiments.

[0083] It should be clarified that this application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described as examples. However, the method process of this application is not limited to the specific steps described. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0084] The functional blocks shown in the above-described structural diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0085] It should also be noted that the exemplary embodiments mentioned in this application describe methods or systems based on a series of steps or apparatus. However, this application is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0086] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0087] The above description is merely a specific implementation of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the protection scope of this application.

Claims

1. A nuclear accident information processing method, characterized by, The method comprises: obtaining N nuclear power accident information corresponding to a target nuclear power accident terminal state, each of the nuclear power accident information comprising an initiating event and a functional event, N being a positive integer and N being greater than or equal to 2; obtaining fault tree information corresponding to each of the nuclear power accident information according to each of the nuclear power accident information, each of the fault tree information comprising basic events, intermediate events, top events and connection relationships between the events; calling a plurality of working nodes to perform parallel processing on the N fault tree information to obtain a minimum cut set corresponding to each of the fault tree information, the minimum cut set being a minimum set of basic events leading to the occurrence of the top event; merging the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain a global minimum cut set of the target nuclear power accident terminal state.

2. The nuclear accident information processing method according to claim 1, characterized by, The merging of the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain the global minimum cut set of the target nuclear power accident terminal state comprises: merging the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain a first set, each of the minimum cut sets being a first subset in the first set; in a case where it is determined that there are duplicate subsets in the plurality of first subsets, performing a deduplication processing on the plurality of first subsets to obtain a second set, the second set comprising a plurality of second subsets, any two of the second subsets comprising different basic events; in a case where the second set satisfies a preset filtering condition, performing a filtering processing on the plurality of second subsets in the second set to obtain the global minimum cut set.

3. The nuclear accident information processing method according to claim 2, characterized by, The duplicate subsets are determined according to the following manner: for each of the first subsets, performing a small-to-large sorting on the identifiers of the basic events in the first subset to obtain sorted identifiers, and generating a hash value corresponding to the first subset according to the sorted identifiers; in a case where there is a same hash value in the hash values corresponding to the plurality of first subsets, it is determined that there are duplicate subsets in the plurality of first subsets.

4. The nuclear accident information processing method according to claim 2, characterized by, The filtering processing on the plurality of second subsets in the second set to obtain the global minimum cut set comprises: for each of the second subsets, in a case where the number of basic events in the second subset is greater than a preset number, marking the second subset as a to-be-deleted subset; deleting the second subsets marked as to-be-deleted subsets in the plurality of second subsets to obtain the global minimum cut set.

5. The nuclear accident information processing method according to claim 2, characterized by, The filtering processing on the plurality of second subsets in the second set to obtain the global minimum cut set comprises: for each of the second subsets, in a case where the failure probability of the second subset is less than a preset probability, marking the second subset as a to-be-deleted subset; deleting the second subsets marked as to-be-deleted subsets in the plurality of second subsets to obtain the global minimum cut set.

6. The nuclear accident information processing method according to claim 1, characterized by, The obtaining of the fault tree information corresponding to each of the nuclear power accident information comprises: for each of the nuclear power accident information, taking the initiating event and the functional event in the nuclear power accident information as intermediate events; connecting the intermediate events, the basic events and the top events through logical gates to obtain a fault tree; Obtain first information of the intermediate event, and associate the first information with a fault tree to obtain fault tree information, the first information being a sub-fault tree or a corresponding basic event corresponding to the intermediate event.

7. The nuclear accident information processing method according to claim 1, characterized by, The plurality of working nodes are in communication connection with the master node. The plurality of working nodes are called to perform parallel processing on the N fault tree information to obtain a minimum cut set corresponding to each fault tree information, including: The master node determines a working node from the plurality of connected nodes, and the state of the working node is an idle state; In a case where the number of working nodes is greater than or equal to N, the master node distributes N fault tree information to N working nodes, and each working node generates a minimum cut set corresponding to the fault tree information according to the fault tree information by using a preset algorithm; Or, In a case where the number of working nodes is less than N, the master node divides the N fault tree information into M sub-tasks, and distributes the M sub-tasks to the working nodes by using the master node, M being a positive integer, M being the same as the number of working nodes, each working node being allocated a sub-task, and each sub-task including at least one fault tree information.

8. The nuclear accident information processing method according to claim 1, characterized by, Before the N nuclear power accident information corresponding to the target nuclear power accident final state is obtained, the method further includes: In response to an accident analysis instruction, a plurality of nuclear power accident final state identifiers are displayed; In response to a selection operation on a nuclear power accident final state identifier, a nuclear power accident final state identified by the selected nuclear power accident final state identifier is taken as a target nuclear power accident final state.

9. A nuclear accident information processing apparatus characterized by comprising: The device includes: An acquisition module is configured to obtain N nuclear power accident information corresponding to a target nuclear power accident final state, each nuclear power accident information including an originating event and a functional event, and N being a positive integer; A first processing module is configured to obtain, according to each nuclear power accident information, fault tree information corresponding to each nuclear power accident information, each fault tree information including a basic event, an intermediate event, a top event, and a connection relationship between events; A calling module is configured to call a plurality of working nodes to perform parallel processing on the N fault tree information to obtain a minimum cut set corresponding to each fault tree information, the minimum cut set being a smallest basic event set causing the top event to occur; A second processing module is configured to merge the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain a global minimum cut set of the target nuclear power accident final state.

10. The nuclear accident information processing apparatus according to claim 9, characterized in that, The second processing module includes a merging submodule, a deduplication submodule, and a filtering submodule; The merging submodule is configured to merge the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain a first set, each minimum cut set being a first subset in the first set; The deduplication submodule is configured to, in a case where it is determined that there are duplicate subsets in the plurality of first subsets, perform deduplication processing on the plurality of first subsets to obtain a second set, the second set including a plurality of second subsets, and any two second subsets including different basic events. The second processing module includes a merging submodule, a deduplication submodule, and a filtering submodule; The merging submodule is configured to merge the minimum cut sets corresponding to the obtained plurality of fault tree information to obtain a first set, each minimum cut set being a first subset in the first set; The deduplication submodule is configured to, in a case where it is determined that there are duplicate subsets in the plurality of first subsets, perform deduplication processing on the plurality of first subsets to obtain a second set, the second set including a plurality of second subsets, and any two second subsets including different basic events. A filtering submodule is configured to perform filtering processing on a plurality of the second subsets in the second set to obtain the global minimum cut set when the second set meets a preset filtering condition.

Images