SearcharxivSearch

arXiv · 1501.04936

Differences between semi-quantitative and quantitative approaches for probabilistic assessment of technological risks

Abstract

The aim of this paper is to compare the probabilistic approach based on fault trees and event trees, to an approach called "semi-quantitative" as presented by the guide Omega 10 (INERIS, 2008), for the industrial risk management. A brief presentation of the ''classical'' probabilistic risk assessment as well as the ''semi-quantitative'' approach is proposed. Then, a case study is detailed to illustrate and compare their use. This case study focuses on a low pressure separator (water/gas/condensate) for which scenarios have been identified around the undesired event "gas leak due to overpressure in the separator.'' The system includes a control loop and the following safety barriers: an alarm with operator actions, a safety instrumented system, two safety relief valves, and a blast-proof partition. This case study therefore represents a relatively conventional system in the industry. Regarding to the implementation of the two approaches, the assessment according to the Omega 10 guide is easier and faster. In terms of results, differences can be observed, up to a factor 10.

Explore related subjects

Keep this discovery

BibTeXRIS

Elsa Rosner, Florent Brissaud, Bruno Declerck, Yann Flauw, Valérie De Dianous. 2015-01-20. Differences between semi-quantitative and quantitative approaches for probabilistic assessment of technological risks. https://arxiv.org/abs/1501.04936

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

KEEP EXPLORING

Related papers

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

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

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