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

Dynamic fault tree analysis method based on improved sequential binary decision diagram

A technology of dynamic fault tree and binary decision diagram, applied in the field of data processing, can solve problems such as inability to coexist, not completely independent of each other, invalid nodes in SBDD diagram, etc., and achieve accurate qualitative and quantitative analysis.

Active Publication Date: 2017-01-11
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the dynamic fault tree after replacement, due to the occurrence of repeated variables, the bottom events are not completely independent of each other, which may cause the SBDD diagram established under the condition of a given incomplete variable ordering There are invalid nodes
Suppose there are two variables x i and x j , when x i = 0, x j = 0, SBDD is the full sorting of all nodes in the fault tree, then there must be such a sequence: From the known conditions, it can be seen that and x j cannot coexist, so the cut set obtained from this sequence is invalid

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
  • Dynamic fault tree analysis method based on improved sequential binary decision diagram
  • Dynamic fault tree analysis method based on improved sequential binary decision diagram
  • Dynamic fault tree analysis method based on improved sequential binary decision diagram

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] The technical solution of the invention will be described in detail below in conjunction with the accompanying drawings. The extended SBDD method proposed by this application can effectively convert the dynamic fault tree based on Pandora into SBDD. The method mainly includes two aspects: an improved bottom event sorting rule and a dynamically optimized SBDD generation algorithm. The basic idea of ​​the improved bottom event sorting rule is to use the fault tree structure relationship and the relationship between bottom events to assign different sorting priorities to bottom events. Dynamically optimized SBDD generation algorithm uses extended Shannon formula to generate SBDD on the basis of bottom event sorting queue. In the iterative process of using extended Shannon formula to generate SBDD, the simplified rules are used to delete invalid nodes before each iteration.

[0041] Step 1: Replace the dynamic gate in the dynamic fault tree

[0042] Convert the subtree wit...

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 discloses a dynamic fault tree analysis method based on an improved sequential binary decision diagram (SBDD), relates to a dynamic fault tree analysis method based on Pandora, and belongs to the technical field of data processing. According to the method, global sequencing is performed on bottom events of a fault tree in consideration with a relation of the bottom events, and invalid nodes of the SBDD tree are dynamically deleted in an extended SBDD algorithm based on the global sequencing of the bottom events and the relation between dynamic bottom events and static bottom events to eliminate invalid branches, so that the dynamic fault tree based on Pandora can be effectively converted into the SBDD, less SBDDs are generated, an invalid cut set does not exit, and qualitative analysis and quantitative analysis of the fault tree are more accurate.

Description

technical field [0001] The invention discloses an improved dynamic fault tree analysis method based on a sequence binary decision graph, relates to a dynamic fault tree analysis method based on Pandora, and belongs to the technical field of data processing. Background technique [0002] In 2005, Pandora was first proposed by Martin Walker in "Project Pandora: Temporal FaultTree Analysis". By introducing a new time gate, Pandora can describe the sequence relationship of bottom events more completely. At the same time, Pandora adds new rules and algorithms, through which the Pandora dynamic fault tree can be analyzed. [0003] At present, the methods for analyzing dynamic fault trees based on Pandora mainly include algebraic relational method and SBDD (Sequential Binary Decision Diagram) method. The algebraic relational method uses the theoretical knowledge in Pandora to analyze the dynamic fault tree, but this method is to decompose the dynamic fault tree, which is easy to ...

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): G05B23/02
CPCG05B23/0248
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