On Finding a Minimal Set of Diagnostic Tests
β Scribed by Hadlock, Frank
- Book ID
- 117903776
- Publisher
- Institute of Electrical and Electronics Engineers
- Year
- 1967
- Tongue
- English
- Weight
- 380 KB
- Volume
- EC-16
- Category
- Article
- ISSN
- 0367-7508
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper presents a new method for identification of minimal cut sets in a fault tree. The (non-minimal) cut sets are found by a modification of the well-known MOCUS algorithm. These cut sets are stored in a virtual tree structure which requires far less core space than the MOCUS cut set matrix. T
are circled. This total LM set is far from being minimal. Actually, as shown in Fig. , only three of the disks are A two-dimensional binary object can be totally covered by a set of disks. From this follows that any object might be needed to cover the entire object. ## represented by these disks ra