Probability of Failure of Safety-Critical Systems Subject to Partial Tests

Florent Brissaud; Anne Barros; Christophe Bérenguer

Home/Archive/arXiv

arXiv · 1007.5448

Probability of Failure of Safety-Critical Systems Subject to Partial Tests

Florent Brissaud·Anne Barros·Christophe Bérenguer

View original source ↗Read source document ↗Export metadata ↓

Abstract

A set of general formulas is proposed for the probability of failure on demand (PFD) assessment of MooN architecture (i.e. k-out-of-n) systems subject to proof tests. The proof tests can be partial or full. The partial tests (e.g. visual inspections, partial stroke testing) are able to detect only some system failures and leave the others latent, whereas the full tests refer to overhauls which restore the system to an as good as new condition. Partial tests may occur at different time instants (periodic or not), up to the full test. The system performances which are investigated are the system availability according to time, the PFD average in each partial test time interval, and the total PFD average calculated on the full test time interval. Following the given expressions, parameter estimations are proposed to assess the system failure rates and the partial test effectiveness according to feedback data from previous test policies. Subsequently, an optimization of the partial test strategy is presented. In the 2oo6 system given as example, an improvement of about 10% of the total PFD average has been obtained, just by a better (non-periodic) distribution of the same number of partial tests, in the full test time interval.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Florent Brissaud, Anne Barros, Christophe Bérenguer. 2010-07-30. Probability of Failure of Safety-Critical Systems Subject to Partial Tests. https://arxiv.org/abs/1007.5448

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗

arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗

arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗