Confronta i metodi

	Analisi Bayesiana degli Alberi di Guasto	Analisi ad Albero dei Guasti (Fault Tree Analysis, FTA)
Campo	Disegno sperimentale	Affidabilità
Famiglia	Process / pipeline	Process / pipeline
Anno di origine	2001 (BFTA mapping); Bayesian networks: 1988	1981
Ideatore	Andrea Bobbio, Luca Portinale et al. (mapping FTA to Bayesian networks); Judea Pearl (Bayesian networks)	Vesely et al. (US NRC Fault Tree Handbook)
Tipo	Probabilistic reliability / safety analysis	Deductive top-down failure analysis
Fonte seminale	Bobbio, A., Portinale, L., Minichino, M., & Ciancamerla, E. (2001). Improving the analysis of dependable systems by mapping fault trees into Bayesian networks. Reliability Engineering & System Safety, 71(3), 249–260.	Vesely, W. E., Goldberg, F. F., Roberts, N. H., & Haasl, D. F. (1981). Fault Tree Handbook (NUREG-0492). U.S. Nuclear Regulatory Commission.
Alias	BFTA, Bayesian FTA, Bayesian network fault tree, probabilistic fault tree analysis	FTA, Fault Tree Method, Top-Down Reliability Analysis, Hata Ağacı Analizi
Correlati	5	3
Sintesi	Bayesian Fault Tree Analysis (BFTA) extends classical fault tree analysis by converting the fault tree structure into an equivalent Bayesian network, enabling probabilistic inference in both forward (prediction) and backward (diagnosis) directions. This integration allows analysts to update failure probability estimates with observed evidence, quantify uncertainty explicitly, and identify the most probable root causes of a top-level system failure.	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.