Fault tree maximum probability minimum cut set solving method based on local search

A maximum probability, local search technology, applied in other database retrieval, other database indexing, digital data information retrieval, etc., can solve the problem of low solution efficiency and achieve the effect of improving solution efficiency and excellent storage space

Pending Publication Date: 2021-04-02
SUN YAT SEN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] The present invention provides a method for solving the maximum probability minimum cut set of the fault tree based on local search in order to ov...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fault tree maximum probability minimum cut set solving method based on local search
  • Fault tree maximum probability minimum cut set solving method based on local search
  • Fault tree maximum probability minimum cut set solving method based on local search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0063] This embodiment provides a method for solving a maximum probability minimum cut set of a fault tree based on local search, and the method includes:

[0064] S1: perform an initial logical transformation on the fault tree; obtain a Boolean expression;

[0065] S2: Model a partial maximum satisfiability problem according to a Boolean expression;

[0066] S3: Use a local search-based heuristic algorithm to solve some instances of maximum satisfiability problems;

[0067] S4: Transformation of the maximum probability minimum cut set result: Perform reverse logarithmic transformation on the result of S3 to obtain the final maximum probability minimum cut set and its joint probability.

[0068] Such as image 3 As shown, this embodiment can be summarized as mainly including two parts. First, the basic model of the fault tree is encoded and transformed into the input of the weighted partial maximum Boolean satisfiable problem satisfying the CNF paradigm; that is, S1-S2. Se...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a fault tree maximum probability minimum cut set solving method based on local search. The method comprises the steps of S1, performing initial logic conversion on a fault tree; obtaining a Boolean expression; s2, modeling a part of the maximum satisfiability problem according to the Boolean expression; s3, using a heuristic algorithm based on local search to solve part ofthe maximum satisfiability problem instances; and S4, maximum probability minimum cut set result conversion: performing inverse logarithm conversion on the result of the S3, and solving a final maximum probability minimum cut set and a joint probability of the final maximum probability minimum cut set. According to the method, the maximum probability minimum cut set of the fault tree is solved byutilizing a partial maximum satisfiability problem and based on an efficient heuristic method of local search, and the minimum basic event combination which most possibly causes the system fault is searched for with more excellent storage space and solving performance. The solving efficiency of the maximum probability and minimum cut set of the complex fault tree can be effectively improved.

Description

technical field [0001] The invention relates to the field of fault tree analysis, more specifically, to a method for solving the maximum probability minimum cut set of the fault tree based on local search. Background technique [0002] Fault tree (fault tree, FT), also known as fault tree, is a special inverted logical causality diagram technique used to describe system failure modes. The fault tree uses event symbols, logic gate symbols and transition symbols to describe the causal relationship between various events in the system, and internally connects each event in the system fault analysis, each fact and result of the analysis, and makes them a whole. The input event of the logic gate is the "cause" of the output event, and the output event of the logic gate is the "effect" of the input event. It combines top events, intermediate events (gate events) and basic events, and connects them with corresponding logic symbols. A fault tree model such as figure 1 shown. The...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F16/901G06F16/903G06F16/9032
CPCG06F16/9027G06F16/9032G06F16/90335
Inventor 万海李佳罗炜麟曾娟赵杭范科峰
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap