Published December 1986
| Version v1
Journal article
Disjoint tree
Description
An approach to construct a disjoint tree for an event set is presented, in which the total number and order of terms of a cut set (path set) are decreased rapidly through the separation of independent terms and the collection of common factors. All of the branches of the disjoint tree are disjoint to one another, consequently, the occurrence probability of the top event can be obtained straightforwards. Application examples are given. The extension of the approach to the multistate systems and the approximate calculation method are discussed
Additional details
Additional titles
- Subtitle (English)
- A new approach for quantitative analyses of network system and fault tree
Publishing Information
- Journal Title
- Chin. J. Comput. Phys.
- Journal Volume
- 3
- Journal Issue
- 4
- Series
- Chin. J. Comput. Phys.
- Journal Page Range
- 401-408
INIS
- Country of Publication
- China
- Country of Input or Organization
- China
- INIS RN
- 19018740
- Subject category
- S22: GENERAL STUDIES OF NUCLEAR REACTORS;
- Descriptors DEI
- ALGORITHMS; FAULT TREE ANALYSIS; MATHEMATICAL MODELS; NETWORK ANALYSIS; RELIABILITY; SYSTEMS ANALYSIS; TRANSIENT OVERPOWER ACCIDENTS
- Descriptors DEC
- ACCIDENTS; REACTOR ACCIDENTS; SYSTEM FAILURE ANALYSIS