Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia

Rauzy, Antoine; Dutuit, Yves

doi:10.1016/s0951-8320(97)00034-3

Cited by 100 publications

(39 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…correlation between responses, correlation between capacities) could not considered by this method. The method using Binary Decision Diagram (BDD) 14 is one of the methods based on truth table.…”

Section: Analytical Methods For Conditional System Failure Probabilitymentioning

confidence: 99%

Effect of Analytical Methodology for Assessment on Seismically Induced Core Damage

Uchiyama¹,

Kawaguchi²,

Wakabayashi

2011

JPES

View full text Add to dashboard Cite

The purpose of this study is to investigate the effects of the difference between analytical methodologies for seismic probabilistic safety assessment (PSA), especially the difference in the probability of system failures and core damage sequences. We selected two methods, upper bound approximation (UBA) using minimal cut sets and direct quantification using Monte Carlo simulation (DQFM) for comparison. The former is often used in PSA for both internal and external event. The latter is developed in Japan Atomic Energy Agency (JAEA) as a part of SECOM2, a system reliability analysis code for seismic PSA, and expanded to divide the core damage state into different core damage sequences. The result showed that there is a significant difference between UBA method and DQFM method.

show abstract

Section: Analytical Methods For Conditional System Failure Probabilitymentioning

confidence: 99%

Effect of Analytical Methodology for Assessment on Seismically Induced Core Damage

Uchiyama¹,

Kawaguchi²,

Wakabayashi

2011

JPES

View full text Add to dashboard Cite

show abstract

“…Regarding the algorithms for fault tree generation used in FSAP, the minimisation routines used to extract the set of minimal cut sets are based on classical procedures for minimisation of Boolean functions, specifically on the implicit-search procedure described in [CM92,CM93,Rau93,RD97], based on BDDs [Bry92] (see also [RPA08] for enhanced methods to convert fault trees into BDDs). Alternative explicit-search and satisfiability based techniques for computation of prime implicants are described, e.g.…”

Section: Related Workmentioning

confidence: 99%

The mechanical generation of fault trees for reactive systems via retrenchment I: combinational circuits

Banach

Bozzano

2013

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. The manual construction of fault trees for complex systems is an error-prone and time-consuming activity, encouraging automated techniques. In this paper we show how the retrenchment approach to formal system model evolution can be developed into a versatile structured approach for the mechanical construction of fault trees. The system structure and the structure of retrenchment concessions interact to generate fault trees with appropriately deep nesting. We show how this approach can be extended to deal with minimisation, thereby diminishing the post hoc subsumption workload and potentially rendering some infeasible cases feasible.

show abstract

“…ese operations extract knowledge from the information carried in the composition vectors and store this knowledge in the minimal possible schemes. e naming of these operations is aer Shannon's decomposition [11].…”

Section: Decomposition and Recomposition Operationsmentioning

confidence: 99%

A Heuristic Methodology for Efficient Reduction of Large Multistate Event Trees

Marcoulaki

2013

Journal of Quality and Reliability Engineering

View full text Add to dashboard Cite

is work proposes a new methodology for the management of event tree information used in the quantitative risk assessment of complex systems. e size of event trees increases exponentially with the number of system components and the number of states that each component can be found in. eir reduction to a manageable set of events can facilitate risk quanti�cation and safety optimization tasks. e proposed method launches a deductive exploitation of the event space, to generate reduced event trees for large multistate systems. e approach consists in the simultaneous treatment of large subsets of the tree, rather than focusing on the given single components of the system and getting trapped into guesses on their structural arrangement.

show abstract

Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia

Cited by 100 publications

References 9 publications

Effect of Analytical Methodology for Assessment on Seismically Induced Core Damage

Effect of Analytical Methodology for Assessment on Seismically Induced Core Damage

The mechanical generation of fault trees for reactive systems via retrenchment I: combinational circuits

A Heuristic Methodology for Efficient Reduction of Large Multistate Event Trees

Contact Info

Product

Resources

About