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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com