Event tree simplifying method, event tree simplifying apparatus and program

The event tree simplification method aggregates sequences with identical consequences and maintains fault tree conditions to reduce calculation time and maintain accuracy, addressing the complexity of nuclear power plant risk assessments.

JP2024165367AActive Publication Date: 2024-11-28MITSUBISHI HEAVY IND LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2023081512
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-17
Publication Date
2024-11-28
Estimated Expiration
2043-05-17

AI Technical Summary

Technical Problem

Nuclear power plants have complex event trees with numerous mitigation measures and sequences, leading to prolonged calculation times for risk assessment, hindering timely understanding and implementation of safety measures.

Method used

An event tree simplification method that aggregates sequences with the same consequence and no intervening branches, ensuring no change in risk evaluation accuracy by maintaining fault tree conditions.

Benefits of technology

Reduces calculation time for risk assessment by simplifying event trees without affecting accuracy, enabling quicker risk factor understanding and safety measure implementation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024165367000001_ABST
    Figure 2024165367000001_ABST
Patent Text Reader

Abstract

To provide a method of simplifying an event tree.SOLUTION: An event tree simplifying method includes the steps of: extracting, from an event tree, two sequences having the same consequence and last branches located on the same sequence, the two branches having no branch interposed therebetween; determining whether the extracted two sequences can be consolidated or not; and consolidating the two sequences when the sequences are to be consolidated.SELECTED DRAWING: Figure 2
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present disclosure relates to an event tree simplifying method, an event tree simplifying device, and a program. [Background technology]

[0002] Probabilistic Risk Assessment (PRA) is used for risk assessment of nuclear power plants (for example, Patent Document 1). In PRA, equipment, etc. are comprehensively extracted from the system diagram of the plant, failure modes of the extracted equipment, etc. are examined, and an event tree and a fault tree are created.

[0003] An event tree (hereinafter sometimes referred to as ET) is one of the methods for evaluating the reliability of a system. ET is a tree diagram that starts with the occurrence of an undesirable event (initiating event), arranges the mitigation measures assumed to respond to the event in chronological order, and has each success and failure as a branch. An example of ET is shown in Figure 1A. ET100A shows that after the occurrence of an initiating event, if mitigation measure 1 is successful, or if mitigation measure 1 fails but mitigation measure 2 is successful, the event can be safely completed, and if both fail, an accident will occur. The "Mitigation Measure 1" and "Mitigation Measure 2" following "Occurrence of an Undesirable Event (Initiating Event)" at the top of ET100A are called headings. Mitigation measures 1 and 2 are measures and devices taken to stop the progression of an event when an abnormality occurs in a nuclear power plant so that it does not lead to a serious accident. Mitigation measure 1 is executed first, and mitigation measure 2 is executed depending on the result. Below the heading, a branching tree diagram is shown depending on whether the mitigation measures 1 and 2 indicated under the heading are successful or unsuccessful. If successful, the system branches to the right along the tree diagram, and if unsuccessful, the system branches downward, and so on until it reaches the right. The final system state (called a consequence) is shown at the right end of the tree diagram. Consequences are classified into various states depending on the combination of success and failure of the mitigation measures. As shown in the example of Figure 1A, in the simplest case, they are classified into safety or accident. The progression of events leading up to each consequence is called a sequence or scenario.

[0004] In ET100A, it is possible to calculate the occurrence frequency of each sequence by giving the occurrence frequency of the initiating event and the probability of success / failure of each mitigation measure. In this case, it is common to calculate the failure probability of each mitigation measure using a fault tree (hereinafter sometimes referred to as FT). An example of an FT is shown in Figure 1B. FT100B shows the combination of conditions under which the top gate event occurs in a tree structure. The top gate of FT100B is "Failure of Mitigation Measure 1". The symbol connected to the bottom of the top gate is called an AND gate, and indicates that "Failure of Mitigation Measure 1" occurs when both "Failure of Equipment A / B" and "Failure of Equipment C" connected to the AND gate occur. The symbol connected to the bottom of "Failure of Equipment A / B" is called an OR gate, and indicates that "Failure of Equipment A / B" occurs when either "Failure of Equipment A" or "Failure of Equipment B" connected to the OR gate occurs. The events at the bottom of FT100B ("Failure of Equipment A", "Failure of Equipment B", "Failure of Equipment C") are called primitive events, and "Failure of Equipment A / B" located between the top gate and primitive events is called intermediate gate. Primitive events are failures or failures that cannot be broken down into smaller units. FT100B indicates that mitigation measure 1 fails when either "Failure of Equipment A" or "Failure of Equipment B" occurs and also when equipment C fails. Given the failure probabilities of equipment A to C, the failure probability of mitigation measure 1 can be calculated. Similarly, the failure probability of mitigation measure 2 can be calculated from the FT (not shown) of mitigation measure 2. By applying the failure probability of each mitigation measure calculated based on the FT to each branch of the ET and giving the occurrence probability of the initiating event, it becomes possible to systematically quantify the risk of the target system. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2021-117092 A Summary of the Invention [Problem to be solved by the invention]

[0006] Nuclear power plants have large-scale and complex control and safety functions, and there are a wide variety of patterns of initiating events and mitigation measures. Therefore, many mitigation measures and branches are introduced into the ET for evaluating risk, and the number of sequences becomes enormous. When trying to calculate the occurrence frequency for all sequences, the calculation time tends to become long. The long calculation time is an obstacle to understanding the risk factors of the plant in a timely manner and taking necessary safety measures. Therefore, we provide a technology that improves the calculation speed by simplifying the ET structure while maintaining the calculation accuracy of risk evaluation (occurrence frequency of sequences).

[0007] The present disclosure provides an event tree simplification method, an event tree simplification device, and a program that can solve the above problems. [Means for solving the problem]

[0008] The method for simplifying an event tree to be evaluated in the present disclosure includes the steps of extracting from an event tree two sequences whose consequences are identical, whose final branch is in the same sequence, and whose two branches have no other branches between them, determining whether the two extracted sequences can be aggregated, and aggregating the two sequences if it is determined that the sequences can be aggregated.

[0009] In addition, the event tree simplification device disclosed herein includes means for extracting from the event tree two sequences that have the same consequence, a final branch in the same sequence, and no other branches between the two branches, means for determining whether the two extracted sequences can be aggregated, and means for aggregating the two sequences if it is determined that the sequences can be aggregated.

[0010] In addition, the program disclosed herein causes a computer to execute the steps of extracting two sequences from an event tree that have the same consequence, whose final branch is in the same sequence, and where no other branches exist between the two branches, determining whether the two extracted sequences can be aggregated, and aggregating the two sequences if it is determined that the sequences can be aggregated. Effect of the Invention

[0011] According to the above-described event tree simplification method, event tree simplification device, and program, the structure of the event tree can be automatically simplified. [Brief description of the drawings]

[0012] [Figure 1A] FIG. 13 is a diagram illustrating an example of an event tree. [Figure 1B] FIG. 2 is a diagram illustrating an example of a fault tree. [Diagram 2] 1 is a block diagram showing an example of an event tree simplifying device according to an embodiment; [Diagram 3] 11 is a flowchart illustrating an example of an event tree simplification process according to an embodiment. [Figure 4A] FIG. 1 is a first diagram illustrating an extraction process according to an embodiment. [Figure 4B] FIG. 2 is a second diagram illustrating the extraction process according to the embodiment. [Figure 4C] FIG. 3 is a third diagram illustrating the extraction process according to the embodiment. [Figure 4D] FIG. 4 is a fourth diagram illustrating the extraction process according to the embodiment. [Diagram 5] FIG. 11 is a diagram illustrating a determination of whether or not aggregation is possible according to an embodiment. [Figure 6] FIG. 13 is a diagram illustrating simplification of an event tree, etc., in an embodiment. [Figure 7] FIG. 2 is a diagram illustrating an example of a hardware configuration of the event tree simplification device according to the embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] <Embodiment> Hereinafter, the event tree simplification method of the present disclosure will be described with reference to FIGS. (System Configuration) 2 is a block diagram showing an example of an event tree simplification device (hereinafter, referred to as an ET simplification device) according to an embodiment. The ET simplification device 10 automatically simplifies the ET while maintaining the calculation accuracy of the risk assessment.

[0014] The ET simplification device 10 includes a data acquisition unit 11 that acquires various data such as the ET to be simplified, an input reception unit 12 that receives user operations, a control unit 13 that controls the execution of the ET simplification process, an output unit 14 that outputs the created ET, etc. as a display device or an electronic file, and a storage unit 15 that stores data acquired by the data acquisition unit 11 and data being processed. The control unit 13 includes an extraction unit 131 that extracts sequences to be aggregated from the ET, a determination unit 132 that determines whether the extracted sequences can be aggregated, and an aggregation unit 133 that aggregates the extracted sequences when it is determined that the sequences can be aggregated. Details of these functional units will be described later in detail using a flowchart (FIG. 3) and the like.

[0015] (operation) Next, the ET simplification process of this embodiment will be described with reference to FIG. 3. The basic idea is to simplify the structure of the ET by reducing the number of sequences, which are components of the ET, and to reduce the calculation load. In this embodiment, in order to reduce the number of sequences, two sequences are extracted from the original ET, and the extracted sequences are aggregated and integrated into one sequence. At that time, sequences that are candidates for aggregation are searched for, and it is determined whether they can be aggregated, in other words, whether the risk assessment result based on the ET will not change by aggregating the sequences, and aggregation is performed only if there is no change. In the following description, sequences, etc. are described as being aggregated or integrated, but these have the same meaning.

[0016] FIG. 3 is a flowchart showing an example of the event tree simplification process according to this embodiment. First, the data acquisition unit 11 acquires data necessary for processing, and stores the acquired data in the storage unit 15. For example, the data acquisition unit 11 acquires ET data (step S1). The ET data includes headings, branches, boundary conditions of each branch, consequences of each sequence, and the like, and is data describing the structure of ET100A and the like illustrated in FIG. 1A and the like. The boundary conditions of a branch are conditions for calculating the probability of success or failure of an event of a heading related to the branch using a FT set for the branch. For example, for mitigation measure 1 of ET100A in FIG. 1A, one FT100B is shown in FIG. 1B, but risk assessment may be performed by switching the structure of the FT corresponding to mitigation measure 1 depending on the plant situation. In such a case, the boundary conditions are set as conditions for specifying the structure of the FT to be applied to the branch of mitigation measure 1. For one ET, if the FT structure of each branch is switched depending on the boundary conditions, the number of risk assessment patterns will be the same as the number of combinations of boundary conditions of each branch, and the amount of calculation and calculation time will further increase. From this perspective, it is necessary to simplify the ET in order to reduce the calculation time.

[0017] The data acquisition unit 11 also acquires FT data for each heading (step S2). The FT data is data describing the structure of, for example, FT100B as illustrated in FIG. 1B. The description may be in any format. Upon acquiring this data, the control unit 13 executes the following process.

[0018] First, the extraction unit 131 extracts sequences that are candidates for aggregation (step S3). Based on the structure of the ET acquired in step S1, the extraction unit 131 extracts two sequences that (a) have the same consequence, (b) have the same final branch in the same sequence, and (c) are adjacent to each other. Here, reference is made to FIG. 4A. FIG. 4A shows an example of two sequences that are candidates for aggregation. Regarding the extraction condition (a), among the sequences 401 to 404 in FIG. 4A, the sequences that have the same consequence are the sequences 403 and 404 that share the consequence "accident B". Regarding the extraction condition (b), when considering whether the final branches of the sequences 403 and 404 are in the same sequence, the final branch of the sequence 403 is the branch point 406, the final branch of the sequence 404 is the branch point 405, and both the branch points 405 and 406 are in the sequence 401. Therefore, the sequences 403 and 404 satisfy the extraction condition (b). Next, considering extraction condition (c), branch point 405 and branch point 406 are adjacent to each other on sequence 401. Therefore, sequences 403 and 404 satisfy extraction condition (c). Since extraction conditions (a) to (c) are satisfied, extraction unit 131 extracts sequences 403 and 404 as candidates for aggregation targets.

[0019] Next, reference is made to Fig. 4B. Fig. 4B shows another example of two sequences that are candidates for aggregation. Among sequences 411 to 413 in Fig. 4B, sequences 412 and 413 have the same consequence "Accident B", and branch points 414 and 415, which are the last branches, are both on the same sequence 411, and since there is no branch on heading 2, branch points 414 and 415 are adjacent to each other on sequence 411. Therefore, sequences 412 and 413 satisfy extraction conditions (a) to (c), and therefore extraction unit 131 extracts sequences 412 and 413 as candidates for aggregation targets.

[0020] Next, refer to Fig. 4C. In the case of Fig. 4C, the consequences of sequences 422 and 424 are the same, and the final branch (branch points 425, 427) are in the same sequence 421, but because branch point 426 exists between branch point 425 and branch point 427, extraction condition (c) is not satisfied. Therefore, extraction unit 131 does not extract sequences 422 and 424 as candidates for aggregation targets.

[0021] Next, refer to Fig. 4D. In the case of Fig. 4D, the consequences of sequence 432 and sequence 434 are the same, but the last branch (branch points 436 and 437) are not present in the same sequence, and extraction condition (b) is not satisfied. Therefore, extraction unit 131 does not extract sequence 432 and sequence 434 as candidates for aggregation targets.

[0022] In this way, the extraction unit 131 extracts two sequences that satisfy all of the above extraction conditions (a) to (c) as aggregation candidates. When the extraction process of step S3 is completed, the extraction unit 131 determines whether or not a corresponding sequence (extracted sequence) exists (step S4). If an extracted sequence does not exist (step S4; No), the output unit 14 outputs the ET and FT simplified in the process up to that point (step S8), and the process flow of FIG. 3 ends. For example, if no aggregation candidate sequences are extracted in the first process of step S3, the ET acquired in step S1 and the FT acquired in step S2 are output without being simplified.

[0023] On the other hand, if the extracted sequence exists (step S4; Yes), the determination unit 132 determines whether the two extracted sequences can be aggregated. Specifically, the determination unit 132 determines whether the evaluation condition of the branch is maintained even if the FT and boundary condition set for the branch of the previous heading (left heading) and the FT and boundary condition set for the branch of the subsequent heading (right heading) are integrated (step S5). The evaluation condition is maintained means that the probability of success and failure calculated based on the fault tree and boundary condition of the two branches before integration is the same as the probability of success and failure calculated based on the fault tree and boundary condition after integration, that is, there is no change in the occurrence frequency of the consequence related to the sequence to be aggregated, which is calculated from the ET before and after the aggregation of the sequences. If the evaluation condition is maintained, the determination unit 132 determines that the two sequences can be aggregated, and if not, determines that they cannot be aggregated. This makes it possible to maintain the calculation accuracy of the risk evaluation before the sequence aggregation.

[0024] Here, FIG. 5 is referred to. Among sequences 501 to 504 in FIG. 5, sequences 503 and 504 are sequences extracted as candidates for aggregation. In risk evaluation using ET, conditions specific to each branch of each heading (the above-mentioned boundary conditions) may be given. In the example of FIG. 5, house events "ABC"=TRUE, "PQR"=TRUE, and "XYZ"=TRUE are set as boundary conditions for heading 2. In order to aggregate two sequences, it is necessary to integrate FTs that are failure factors of the headings leading to the sequence and to integrate the boundary conditions. In that case, if the boundary conditions satisfy either of the following (d) or (e), the evaluation conditions of the sequences are not maintained, and the risk evaluation results change before and after the aggregation of the sequences. (d) Conflicting boundary conditions are set. (e) A condition is set for the latter heading that is satisfied if the former heading is successful.

[0025] Regarding the judgment condition (d) for judging whether the evaluation condition is maintained by the aggregation of the sequence, for example, in the branch of the heading 1 in FIG. 5, the boundary condition is set for the base event A included in the FT applied to the branch, that the base event A does not occur (for example, the pump A is not broken), and the probability of failure of the event of the heading 1 is calculated by the FT based on this boundary condition. In this case, if the branch of the heading 2 has a boundary condition that contradicts the condition that the base event A does not occur (or a boundary condition whose content is incompatible with the content that the base event A does not occur) set (for example, when the house event "PQR" = TRUE is a condition indicating that the base event A may occur), the judgment unit 132 judges that the boundary condition of the heading 2 has a condition that contradicts the boundary condition of the heading 1, and judges that the evaluation condition of the sequence is not maintained. When the boundary conditions of the front and rear branches have contradictory conditions set, it is logically impossible to integrate such boundary conditions, and therefore the judgment unit 132 judges that the two extracted sequences cannot be aggregated.

[0026] Regarding the judgment condition (e) for judging whether the evaluation condition is maintained, for example, if a boundary condition that assumes the success of Heading 1 is set in the branch of Heading 2 in Fig. 5, when sequences 503 and 504 are aggregated, it is necessary to integrate the FT of the branch of Heading 1 and the FT of the branch of Heading 2, but in the FT after integration, it is not possible to perform calculations taking into account the boundary condition of Heading 2 that assumes the success of Heading 1, and as a result, the evaluation condition of the original sequence cannot be maintained. In this case, the judgment unit 132 judges that the two extracted sequences cannot be aggregated.

[0027] If neither of the above judgment conditions (d) and (e) is satisfied, the judgment unit 132 judges that the two extracted sequences can be aggregated, that is, the evaluation conditions are maintained even if the sequences are integrated. For example, if a condition unrelated to the FT of the heading 2 is set as the boundary condition of the heading 1, and a condition unrelated to the FT of the heading 1 is set as the boundary condition of the heading 2, the judgment conditions (d) and (e) are not satisfied and the sequences are to be aggregated. In addition, since the boundary conditions are not necessarily set, if no boundary conditions are set for the branches of the two sequences of the aggregation candidates, the judgment conditions (d) and (e) are not satisfied, and the judgment unit 132 judges that the two sequences can be aggregated.

[0028] If either of the above conditions (d) or (e) is satisfied, the determination unit 132 determines that the evaluation conditions of the original sequences are not maintained when the sequences are integrated. If it is determined that the evaluation conditions are not maintained (step S5; No), the determination unit 132 determines that the two sequences cannot be integrated (step S7).

[0029] When it is determined that the evaluation condition is maintained (step S5; Yes), the aggregator 133 merges the two sequences that are candidates for aggregation (step S6). The aggregator 133 performs the following process on the two sequences that are determined to be aggregatable, and merges the ET, FT, and boundary conditions. (1) Aggregate two sequences into a single sequence. (2) The boundary conditions set for the two branches are combined and set for the aggregated branch. (3) The FTs set to two branches are modeled by connecting them with an OR gate and setting them to an aggregated branch.

[0030] FIG. 6 shows an example of ET, FT, and boundary conditions before and after aggregation. As shown in the figure, the two sequences to be aggregated in ET61 before aggregation are integrated into one sequence in ET62 after aggregation, and Heading 1 and Heading 2 in ET61 before aggregation are integrated into Heading 1+2. The integrated sequence is connected to the branch of the integrated heading. When FT63 of Heading 1 failure and FT64 of Heading 2 failure before aggregation are aggregated, the failure of both Heading 1 and Heading 2 is set as the top gate, and they are integrated into FT65, which connects FT63 and FT64 with an OR gate directly below the top gate. When the boundary condition 66 of Heading 1 and the boundary condition 67 of Heading 2 before aggregation are aggregated, they are integrated into boundary condition 68, which includes all of these conditions.

[0031] In this manner, in this embodiment, the ET is simplified by aggregating (integrating) the ET, FT, and boundary conditions. The simplification of the ET can reduce the number of headings and sequences. When considering calculating the occurrence frequency of each sequence, the integration of headings reduces the number of branches, and the integration of sequences reduces the number of sequences, which can reduce the amount of calculation of the occurrence frequency of the entire ET. In addition, in a nuclear power plant or the like, the number of ETs is huge, so when considering performing risk evaluation of the entire plant, the simplification of each ET can reduce the amount of calculation and calculation time required for risk evaluation. Note that, in the method of this embodiment, although the number of sequences is reduced by aggregating sequences, the size of the FT is large (for example, FT65 in FIG. 6), and there is a possibility that the calculation time for the FT will increase. However, in most calculation processing programs for risk evaluation using ET and FT, the following holds: "amount of reduction in calculation time due to reduction in ET branches > amount of increase in calculation time due to enlargement of FT" is established, so that this embodiment can reduce the calculation time.

[0032] When the process of step S6 or step S7 is completed for the sequence extracted in step S4, the control unit 13 repeats the process from step S3 until no sequences to be extracted are found (step S4; No). For example, the aggregated sequence aggregated in the first process and the unaggregated sequence are extracted in the second process of step S3, and if it is determined in step S5 that they can be aggregated, the aggregated sequence and the unaggregated sequence are integrated into one sequence. In this way, by repeating the process of FIG. 3, it is possible to simplify the ET as much as possible.

[0033] (effect) As described above, according to this embodiment, sequences that can be aggregated from a huge and complicated ET without affecting the risk assessment result are systematically extracted and integrated. This allows the ET to be simplified. By simplifying the ET, the calculation time for risk assessment can be shortened. For example, in order to grasp the risk factors of a plant in a timely manner, risks can be quickly evaluated and necessary safety measures can be taken. Although the simplification process itself involves calculation processing, the ET once simplified can be repeatedly used for calculations of various plant states, so that from a long-term perspective, the amount and time of calculation can be reduced. Furthermore, by performing aggregation only when sequences can be aggregated into a logically equivalent sequence, there is no effect on risk assessment and calculation accuracy can be maintained.

[0034] In the above embodiment, the ET used for reliability evaluation of a nuclear power plant is simplified, but the application field of the ET simplification device 10 is not limited to the reliability evaluation of a nuclear power plant, and it can also be applied to other industrial fields where reliability evaluation is performed using ET.

[0035] 9 is a diagram showing an example of the hardware configuration of an event tree simplifying device according to an embodiment. A computer 900 includes a CPU 901, a main storage device 902, an auxiliary storage device 903, an input / output interface 904, and a communication interface 905. The above-described event tree simplification device 10 is implemented in a computer 900. Each of the above-described functions is stored in the auxiliary storage device 903 in the form of a program. The CPU 901 reads the program from the auxiliary storage device 903, loads it in the main storage device 902, and executes the above-described processing in accordance with the program. The CPU 901 also reserves a storage area in the main storage device 902 in accordance with the program. The CPU 901 also reserves a storage area in the auxiliary storage device 903 for storing data being processed in accordance with the program.

[0036] In addition, a program for realizing all or part of the functions of the event tree simplification device 10 may be recorded in a computer-readable recording medium, and the program recorded in the recording medium may be read into a computer system and executed to perform processing by each functional unit. The term "computer system" as used herein includes hardware such as an OS and peripheral devices. In addition, if a WWW system is used, the term "computer system" also includes a homepage providing environment (or display environment). In addition, the term "computer-readable recording medium" refers to a portable medium such as a CD, DVD, or USB, and a storage device such as a hard disk built into a computer system. In addition, if the program is distributed to the computer 900 through a communication line, the computer 900 that receives the program may expand the program in the main storage device 902 and execute the above processing. In addition, the above program may be for realizing part of the above-mentioned functions, and may further be capable of realizing the above-mentioned functions in combination with a program already recorded in the computer system.

[0037] As described above, several embodiments according to the present disclosure have been described, but all of these embodiments are presented as examples and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the gist of the invention. These embodiments and their modifications are included in the scope of the invention and its equivalents as described in the claims, as well as in the scope and gist of the invention.

[0038] <Additional Notes> The event tree simplifying method, the event tree simplifying device, and the program described in each embodiment can be understood, for example, as follows.

[0039] (1) A method for simplifying an event tree to be evaluated according to a first aspect includes the steps of extracting from an event tree two sequences having identical consequences, a final branch in the same sequence, and no other branches between the two branches, determining whether the two extracted sequences can be aggregated, and aggregating the two sequences if it is determined that the sequences can be aggregated. This allows the fault tree to be automatically simplified.

[0040] (2) A method for simplification of an event tree to be evaluated according to a second aspect is the event tree simplification method of (1), in which in the step of determining whether or not aggregation is possible, it is determined whether evaluation conditions for evaluating success and failure based on the fault trees and boundary conditions after integration of the fault trees and boundary conditions of the branches of the two extracted sequences are identical to the evaluation conditions based on the fault trees and boundary conditions of the two branches before integration. This makes it possible to simplify the structure of the ET while maintaining the calculation accuracy of whether a branch related to the sequence to be aggregated is successful or not, which is calculated by the ET before aggregation.

[0041] (3) An event tree simplification method according to a third aspect is an event tree simplification method according to (1) to (2), in which, in the step of determining whether aggregation is possible, if incompatible boundary conditions are set on the branches of the two sequences, it is determined that the two sequences are not aggregatable. This allows the structure of the ET to be simplified while maintaining the calculation accuracy of the success or failure of a branch for the sequence to be aggregated, which is calculated by the ET before aggregation.

[0042] (4) An event tree simplification method according to a fourth aspect is an event tree simplification method according to any one of (1) to (3), in which, in the step of determining whether aggregation is possible, if the boundary condition that is established upon the success of an earlier heading among the headings related to the branching of the two sequences is set for a later heading, it is determined that the two sequences cannot be aggregated. This allows the structure of the ET to be simplified while maintaining the calculation accuracy of the success or failure of a branch for the sequence to be aggregated, which is calculated by the ET before aggregation.

[0043] (5) An event tree simplification method according to a fifth aspect is an event tree simplification method according to any one of (1) to (4), wherein in the step of determining whether or not aggregation is possible, if the boundary condition is not set at the branch of the two sequences, it is determined that the two sequences are aggregatable. This allows the structure of the ET to be simplified while maintaining the calculation accuracy of the success or failure of a branch for the sequence to be aggregated, which is calculated by the ET before aggregation.

[0044] (6) An event tree simplification method according to a sixth aspect is an event tree simplification method according to any one of (1) to (5), wherein in the aggregating step, the two sequences are aggregated into a single sequence, boundary conditions set at the branches of the two sequences are integrated and set at the branches of the aggregated sequence, and fault trees set at the branches of the two sequences are integrated into one fault tree by connecting them with an OR gate, and set at the branches of the aggregated sequence. This allows the structure of the ET to be simplified while maintaining the calculation accuracy of the risk assessment (frequency of occurrence of a sequence).

[0045] (7) An event tree simplification method according to a seventh aspect is an event tree simplification method according to any one of (1) to (6), in which the extracting step, the determining step, and the aggregating step are repeatedly performed on an event tree obtained after aggregating the sequences by the aggregating step, until two of the sequences can no longer be extracted in the extracting step. This allows all sequences to be aggregated to be identified and the structure of the event tree to be simplified as much as possible.

[0046] (8) An event tree simplification device 10 according to an eighth aspect includes means for extracting from an event tree two sequences having identical consequences, a final branch in the same sequence, and no other branches between the two branches, means for determining whether the two extracted sequences can be aggregated, and means for aggregating the two sequences if it is determined that the sequences can be aggregated.

[0047] (9) A program according to a ninth aspect causes a computer 900 to execute the steps of extracting two sequences from an event tree that have identical consequences, whose final branch is in the same sequence, and where no other branches exist between the two branches, determining whether the two extracted sequences can be aggregated, and aggregating the two sequences if it is determined that the sequences can be aggregated. [Explanation of symbols]

[0048] 10. Event Tree Simplifier 11. Data acquisition section 12 Input reception section 13 Control section 131...Extraction part 132...Judgment section 133....Aggregation section 14 Output section 15...Storage section 900...Computer 901···CPU 902...Main memory 903...Auxiliary storage device 904 Input / Output Interface 905 Communication Interface

Claims

1. extracting from the event tree two sequences whose consequences are identical and whose final branches are on the same sequence and no other branches exist between the two branches; determining whether the two extracted sequences are aggregateable; aggregating the two sequences if it is determined that the two sequences can be aggregated; The event tree simplification method has the following structure:

2. In the step of determining whether or not the sequences can be aggregated, it is determined whether an evaluation condition for evaluating success or failure based on the fault trees and boundary conditions after integration of the fault trees and boundary conditions of the branches of the two extracted sequences is the same as the evaluation condition based on the fault trees and boundary conditions of the two branches before integration.

2. The method of claim 1, wherein the event tree is simplified.

3. In the step of determining whether or not the two sequences are aggregatable, if incompatible boundary conditions are set on the branches of the two sequences, the two sequences are determined to be inaggregatable. The method of claim 2 .

4. In the step of determining whether or not the sequences can be aggregated, when the boundary condition that is established when a preceding heading among headings related to the branches of the two sequences is successful is set for a subsequent heading, the two sequences are determined to be aggregateable. The method of claim 2 .

5. In the step of determining whether or not the two sequences are aggregatable, if the boundary condition is not set on the branch of the two sequences, the two sequences are determined to be aggregatable. The method of claim 2 .

6. In the step of aggregating, aggregating the two sequences into a single sequence; aggregating the boundary conditions set on the branches of the two sequences and setting the boundary conditions on a branch of the aggregated sequence; The fault trees set in the branches of the two sequences are integrated into one fault tree by connecting the fault trees with an OR gate, and the integrated fault tree is set in a branch of the aggregated sequence. The method for simplifying an event tree according to claim 1 or 2.

7. In the extracting step, until two of the sequences can no longer be extracted, repeating the extracting step, the determining step, and the aggregating step on the event tree after the sequences are aggregated by the aggregating step; The method for simplifying an event tree according to claim 1 or 2.

8. means for extracting from the event tree two sequences whose consequences are identical, whose final branches are on the same sequence, and no other branches exist between the two branches; means for determining whether the two extracted sequences are aggregateable; means for aggregating the two sequences if it is determined that the sequences can be aggregated; An event tree simplification apparatus having

9. On the computer, extracting from the event tree two sequences whose consequences are identical and whose final branches are on the same sequence and no other branches exist between the two branches; determining whether the two extracted sequences are aggregateable; aggregating the two sequences if it is determined that the two sequences can be aggregated; A program that executes the following.

Citation Information

Patent Citations

  • Human error evaluation support device, and program

    JP2004206438A

  • Risk evaluation system, risk evaluation method and risk evaluation program for nuclear power plant

    JP2021117092A

  • Risk impact evaluation method, risk impact evaluation device, and program

    JP2022111584A

  • Single quantification method of external event PSA model containing multi-compartment propagation scenarios

    US20100082318A1