Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Fault tree minimal cut set solving method based on jump-chronological backtrack

A fault tree, the smallest technology, applied in special data processing applications, instruments, electrical and digital data processing, etc., can solve problems such as a large number of basic events and gate events, consuming huge storage space, etc., to improve the solution speed and efficiency. Effect

Inactive Publication Date: 2018-08-10
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Secondly, the number of basic events and gate events involved in industrial fault trees is huge, and the storage representation requires a huge amount of storage space

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 minimal cut set solving method based on jump-chronological backtrack
  • Fault tree minimal cut set solving method based on jump-chronological backtrack
  • Fault tree minimal cut set solving method based on jump-chronological backtrack

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0023] Unless the context clearly states otherwise, the number of elements and components in the present invention can exist in a single form or in multiple forms, and the present invention is not limited thereto. Although the steps in the present invention are arranged with labels, they are not used to limit the order of the steps. Unless the order of the steps is clearly stated or the execution of a certain step requires other steps as a basis, the relative order of the steps can be adjusted. It can be understood that the term "and / or" used herein refers to and covers any and all possible combina...

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 provides a fault tree minimal cut set solving method based on jump-chronological backtrack, comprising the steps of I, calculating a decision level according to a latest solved minimal cutset; II, performing SATMCS (Satisfiability minimal cut set) backtracking to step I to obtain the decision level, and performing a Boolean constraint propagation process; III, allowing SATMCS to enter a next decision level, and continuing to search for cut sets. The method has the advantages that the method enables the characteristic of minimal cut set solving space distributed aggregation of a fault tree to be effectively utilized, and fault tree minimal cut sets can be solved more efficiently via SATMCS.

Description

technical field [0001] The invention belongs to the technical field of fault tree analysis, and in particular relates to a method for solving a minimum cut set of a fault tree based on jumping backtracking. Background technique [0002] Satisfiability problem (Boolean Satisfiability Problem, SAT) is a problem of judging the satisfiability of Boolean formulas. This problem is the core problem of computer theory and application. SAT is an NP-complete (NPC) problem, which is the performance bottleneck of many problem solving efficiency, including constraint satisfaction (ConstraintSatisfaction), extended reasoning (ExtendInference), theorem proving (TheoremProving) and other fields. [0003] Next, introduce the related concepts of SAT. For a set containing m boolean variables Literal is a Boolean variable or v i The non-(Negation) respectively called v i Positive Literal and Negative Literal of v i and Complementary (Opposite); product (Product) is the conjunction ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F19/00
CPCG16Z99/00
Inventor 魏欧罗炜麟李思洁王立松
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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