Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Feiltreanalyse (FTA)× | Bayesiansk nettverk× | |
|---|---|---|
| Fagfelt≠ | Reliabilitet | Bayesiansk |
| Familie≠ | Process / pipeline | Bayesian methods |
| Opprinnelsesår≠ | 1981 | 1988 |
| Opphavsperson≠ | Vesely et al. (US NRC Fault Tree Handbook) | Judea Pearl |
| Type≠ | Deductive top-down failure analysis | Probabilistic graphical model |
| Opprinnelig kilde≠ | Vesely, W. E., Goldberg, F. F., Roberts, N. H., & Haasl, D. F. (1981). Fault Tree Handbook (NUREG-0492). U.S. Nuclear Regulatory Commission. link ↗ | Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann. ISBN: 978-1558604797 |
| Alias≠ | FTA, Fault Tree Method, Top-Down Reliability Analysis, Hata Ağacı Analizi | Bayes network, belief network, probabilistic graphical model, directed graphical model |
| Relaterte≠ | 3 | 4 |
| Sammendrag≠ | Fault Tree Analysis (FTA) is a top-down, deductive reliability method that begins with an undesired top-level failure event and systematically traces backward through chains of contributing causes using Boolean logic gates (AND, OR). First formalized by Watson at Bell Telephone Laboratories in 1961 and later standardized by Vesely, Goldberg, Roberts, and Haasl in the landmark 1981 NRC Fault Tree Handbook, FTA has become a cornerstone of quantitative risk assessment in nuclear, aerospace, and industrial safety engineering. | A Bayesian network is a probabilistic graphical model, introduced by Judea Pearl in 1988, that encodes a set of variables and their conditional dependencies as a directed acyclic graph (DAG). Each node represents a variable; each directed edge encodes a direct probabilistic influence. By combining Bayes' rule with the graph's conditional independence structure, the model supports reasoning under uncertainty — computing the probability of any variable given observed evidence about others. |
| ScholarGateDatasett ↗ |
|
|