Search arXivSearch

arXiv · 2401.09141

A dependent complex degrading system with non-periodic inspection times

Abstract

This paper analyses a system subject to multiple dependent degradation processes. Degradation processes start at random times following a non homogeneous Poisson process and next dependently propagate. The growth of these degradation processes is modeled using gamma increments. We assume that the arrival of a new process to the system triggers the degradation rate of the processes present in the system. Under this framework, the analytic expression of the system reliability is obtained and bounds of the system reliability are also analyzed. Furthermore, the system is inspected at certain times. Information on the system health is recorded at these inspection times and the decision on performing maintenance actions on the system is taken at these times. We consider in this paper a dynamic inspection policy since the information that becomes available in an inspection time is taken into account to schedule the next inspection time. The maintenance cost for this system is dealt with the use of semi-regenerative process. Numerical examples are performed to illustrate the analytic expressions.

Explore related subjects

Keep this discovery

BibTeXRIS

Inma T. Castro, L. Landesa. 2024-01-17. A dependent complex degrading system with non-periodic inspection times. https://arxiv.org/abs/2401.09141

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