✦ LIBER ✦

Algorithmic fault tree synthesis for control loops

✍ Scribed by Yanjun Wang; William J Rogers; Harry H West; M.Sam Mannan

Book ID: 108473621
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 489 KB
Volume: 16
Category: Article
ISSN: 0950-4230
DOI: 10.1016/s0950-4230(03)00043-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New algorithms for fault trees analysis

✍ Antoine Rauzy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Loop-free algorithms for traversing bina

Loop-free algorithms for traversing binary trees

✍ T. I. Fenner; G. Loizou 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 669 KB

Modular fault tree synthesis—A new metho

Modular fault tree synthesis—A new method for computer-aided fault tree construction

✍ A. Poucet; P. De Meester 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 480 KB

The synthesis of control algorithms for

The synthesis of control algorithms for fault-tolerant distributed computer systems

✍ Jan R Just; Eugeniusz Eberbach 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 593 KB

Algorithm for finding minimal cut sets i

Algorithm for finding minimal cut sets in a fault tree

✍ Ladislav Rosenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit

An algorithm for fault-tree probabilitie

An algorithm for fault-tree probabilities using the factoring theorem

✍ Lavon B. Page; Jo Ellen Perry 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 984 KB