Next Article in Journal
Dynamic Bayesian Modeling of Carbon-Adjusted Costs and Supply Chain Risks for Sustainable Investment in Power Grid Technical Renovation Projects
Next Article in Special Issue
A Parsimonious Quadratic-Exponential Submodel of the Kummer–Beta-G Family: Properties and Regression Modeling
Previous Article in Journal
Adaptive Prescribed-Time Bounded Consensus Tracking for Nonlinear Multi-Agent Systems with Actuator Faults
Previous Article in Special Issue
The Touchard Process for Count Data with Dependent Increments
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Phase-Tagged Fluctuation Analysis of Cumulative Shock Reliability Systems with Phase-Type Inter-Shock Times

Department of Industrial Engineering, Alfaisal University, Riyadh 11533, Saudi Arabia
Mathematics 2026, 14(11), 1920; https://doi.org/10.3390/math14111920
Submission received: 4 May 2026 / Revised: 28 May 2026 / Accepted: 29 May 2026 / Published: 1 June 2026
(This article belongs to the Special Issue Applied Probability and Statistics: Theory, Methods, and Applications)

Abstract

We develop a closed-form analysis of the joint distribution for cumulative shock reliability systems with phase-type inter-shock times. The analytical literature on shock-driven reliability has hitherto been split into two largely separate traditions: scalar fluctuation theory, which delivers closed-form joint distributions of pre-failure and failure-time observables but cannot accommodate matrix phase structure; and matrix-analytic methods, which handle phase-type dynamics naturally but focus on stationary indicators rather than first-passage distributions. We bridge these traditions by introducing a matrix-valued reliability functional Φ ν ( ξ , u , v , ϑ , θ ) that encodes the joint distribution of the failure index, pre-failure damage and time, failure-time damage and time, and the operational phase at the moment of failure. We derive Φ ν in closed form via Sherman–Morrison reduction of the matrix Laplace–Stieltjes transform together with the Dshalalow D -operator, and establish a span-reduction theorem showing that Φ ν lies in a three-dimensional matrix subspace generated by the identity and two matrix LSTs. The functional simultaneously generalizes the scalar fluctuation functional of Dshalalow and White and the phase-tagged first excess functional of Tadj, recovering both as projections. We extract twelve closed-form reliability indices, including the reliability function, mean time to failure, mean overshoot, joint pre-failure and failure transforms, and, new to the cumulative shock literature, the phase distribution at failure and the phase-resolved failure-time distribution. Two structural identities of Wald type emerge as corollaries. The framework reduces to elementary arithmetic for rational model primitives and is verified against 2 × 10 5 Monte Carlo trajectories in a worked example.

1. Introduction

1.1. Motivation

Reliability systems subject to random shocks are pervasive in engineering practice. Aerospace structures suffer fatigue accumulation under aerodynamic loads; semiconductor devices degrade under voltage spikes; mechanical equipment wears under impact; pipelines crack under pressure transients. In each case, the system fails when accumulated damage from intermittent shocks first exceeds a sustainability threshold. The cumulative shock model formalizes this paradigm: shocks arrive at random epochs, deposit non-negative random damage, and the system fails on the first threshold crossing. The model has been studied extensively since [1]; comprehensive surveys appear in [2] and the references in [3].
The central reliability quantities of interest in such systems are the time to failure τ ν , the cumulative damage at failure S ν , the pre-failure system state ( τ ν 1 , S ν 1 ) describing the last surviving moment, and the operational regime in which the system was operating when failure occurred. Operational decisions, such as maintenance scheduling, replacement policies, and inspection intervals, depend on the joint distribution of these quantities rather than their marginals: questions like “with what probability does the system fail during a high-stress operational regime?” or “what is the expected residual time given the system is observed near the threshold?” require the joint law.

1.2. Two Analytical Traditions

Two largely separate analytical traditions have developed for the cumulative shock model. Each captures part of the joint structure, but neither captures all of it.

1.2.1. The Fluctuation-Theoretic Tradition

Originating in the first-passage analysis of [4] and developed extensively by [5,6], this tradition treats the failure event as a first excess of the cumulative-damage process over the threshold. The technical centerpiece is a scalar joint transform
Φ ν ( ξ , u , v , ϑ , θ ) = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 θ τ ν
of the failure index, pre-failure damage and time, and failure-time damage and time. The closed-form expression for Φ ν in terms of the Dshalalow D -operator was applied to reliability under linear degradation by [3], to mixed soft- and hard-shock systems in [7], and to dependent competing failure processes in [8]. The fluctuation-theoretic functional captures the full joint distribution of pre-failure and failure-time observables in a single closed-form expression. Its limitation is that it is intrinsically scalar: when the inter-shock time distribution is phase-type, that is, when an underlying continuous-time Markov chain governs the shock-arrival mechanism, the scalar functional cannot track the chain’s phase, and the joint distribution of failure time and operational phase is unavailable.

1.2.2. The Matrix-Analytic Tradition

The matrix-analytic methods of [9], comprehensively developed in [10], treat phase-type and Markov-modulated systems as quasi-birth-death (QBD) processes. The recent series of [11,12] exemplifies the contemporary state of the art for shock-driven reliability, treating k-out-of-n:G repairable systems with K-mixed redundancy and repairman vacations under PH lifetime, repair, and vacation distributions. Several recent contributions adopted closely related matrix-analytic machinery for shock models: Ref. [13] introduced shock models with matrix Mittag-Leffler distributed inter-arrival times; Ref. [14] analyzed δ -shock models driven by a Markovian arrival process; and Ref. [15] treated a multi-state mixed δ -shock model under discrete phase-type structure. The strength of the QBD approach is its facility with phase information: stationary phase distributions, availability indices conditional on phase, and the rate of occurrence of failures decomposed by phase are all routinely computed. Its limitation is that the analytic emphasis falls on stationary indicators: the joint distribution of first-passage observables ( τ ν , S ν , τ ν 1 , S ν 1 ) together with the phase at failure is not directly available in closed form within the standard QBD apparatus.

1.2.3. The Gap

A reliability analyst studying a shock-driven system with phase-type inter-shock times, therefore, faces a methodological choice: use scalar fluctuation analysis and lose access to phase information, or use matrix-analytic methods and lose access to the joint first-passage distribution. No closed-form joint analysis combining both has previously been available.

1.3. The Phase-Tagged First Excess Framework

A bridge between the two traditions has recently been constructed in [16] via the phase-tagged first excess functional
Ψ ( ξ , θ , u ) i j = E ξ ν e θ τ ν u S ν 1 { J ( τ ν ) = j } | J ( τ 0 ) = i ,
a matrix-valued joint transform that simultaneously tracks the failure index, failure time, and damage at failure (as in the Dshalalow scalar functional), together with the operational phase J ( τ ν ) at failure (as in matrix-analytic methods). The closed-form expression for Ψ is derived via the Sherman–Morrison decomposition of the matrix LST H ( θ ) = ( θ I S ) 1 s α , exploits the rank-one structure of H ( θ ) , and recovers Dshalalow’s scalar formula on the projection α Ψ e . The framework thus inherits the closed-form fluctuation analysis of the Dshalalow lineage while introducing the matrix-valued phase tagging of the Neuts lineage.
The phase-tagged framework, as developed in [16], tracks failure-time observables but not pre-failure observables. For reliability applications, the pre-failure state ( τ ν 1 , S ν 1 ) describing the last surviving moment carries operationally meaningful information: it tells the maintenance planner how close the system was to the threshold before being knocked over, and supports residual-time analyses given the system is observed near the threshold. The Dshalalow–White scalar functional includes these pre-failure variables, but the phase-tagged matrix functional does not. Bridging the two requires extending Ψ to a five-variable matrix-valued joint transform that tracks both pre-failure and failure observables simultaneously, with phase tagging at failure.

1.4. Contributions

This paper makes the following contributions.
1.
We define the matrix-valued reliability functional
Φ ν ( ξ , u , v , ϑ , θ ) i j = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 θ τ ν 1 { J ( τ ν ) = j } | J ( τ 0 ) = i ,
the matrix lift of the Dshalalow–White scalar functional to phase-type inter-shock times with phase tagging at failure (Definition 3).
2.
We derive Φ ν in closed form (Theorem 1). The derivation uses the trajectory decomposition of [16], the indicator D -operator encoding of [6], and a new mixed-LST identity H ( ω ) H ( θ ) = h ( θ ) H ( ω ) that supersedes the standard idempotent identity H ( θ ) 2 = h ( θ ) H ( θ ) when two distinct time variables are tracked.
3.
We establish two consistency relations situating Φ ν in the literature: Φ ν recovers the phase-tagged functional Ψ of [16] when pre-failure tracking is suppressed (Theorem 3), and recovers the scalar Dshalalow–White functional when projected via α Φ ν e (Theorem 4).
4.
We establish a span reduction theorem (Theorem 2): the matrix Φ ν lies in a three-dimensional subspace span { I , H ( θ ) , H ( ω ) } , generalizing the two-dimensional span of [16] and reflecting the joint pre-failure and failure-time structure.
5.
We extract twelve closed-form reliability indices from Φ ν in Section 4: failure-time LST, reliability function, mean time to failure, mean cumulative damage and overshoot, pre-failure damage and time, failure-causing shock magnitude, joint LSTs and PGFs of pre-failure and failure pairs, the phase distribution at failure, and the phase-resolved failure-time distribution.
6.
We obtain two structural identities of Wald type as corollaries (Theorems 6 and 7): MTTF = μ T 0 + μ T E [ ν ] and E [ S ν ] = E [ X 0 ] + μ A E [ ν ] , identifying E [ ν ] as the fundamental scalar of the model. The phase-resolved indices, in particular, are, to our knowledge, new to the cumulative shock reliability literature.
7.
We verify the framework numerically (Section 5) on a model with two-phase Erlang inter-shock times, exponential delay, and shifted-geometric damages, with 2 × 10 5 Monte Carlo trajectories. All twelve closed-form indices agree with the simulation to within the 95% Monte Carlo standard error.
The framework is computationally elementary: when the model primitives a 0 , a , h 0 , h are rational functions of their arguments, every reliability index in Table 1 reduces to a finite Taylor-coefficient extraction, computable in time linear in the threshold p 1 via the recurrence detailed in Appendix B. No iterative matrix solver is required.

1.5. Organization

Section 2 formalizes the cumulative shock reliability model, fixes notation for the phase-type machinery and the D -operator, defines the matrix-valued reliability functional Φ ν , and states the consistency relations to be established. Section 3 derives the closed-form expression for Φ ν via trajectory decomposition and Sherman–Morrison reduction, establishes the span reduction theorem, and proves the two consistency relations. Section 4 extracts the twelve reliability indices and the two Wald-type structural identities. Section 5 presents the worked numerical example with Monte Carlo verification. Section 6 discusses extensions to position-dependent marking, repairable systems, and multi-component structures, and offers methodological observations on the structural role of span dimension. Section 7 concludes. The detailed proof of one algebraic equivalence used in Theorem 3 is in Appendix A, and the rational-PGF computation algorithm is in Appendix B.

2. Model and Preliminaries

This section formalizes the cumulative shock reliability model studied in the paper, fixes notation for the phase-type machinery, and introduces the D -operator that will appear in the main results. We close the section by defining the matrix-valued reliability functional and stating the consistency relations it must satisfy.

2.1. The Cumulative Shock Reliability Model

We consider a system that operates from time t = 0 subject to a sequence of random shocks. Each shock causes a non-negative integer-valued amount of damage; the cumulative damage is monitored against a fixed integer threshold; and the system fails at the first shock that pushes the cumulative damage strictly above the threshold.

2.1.1. Inter-Shock Times

Let τ 0 < τ 1 < τ 2 < denote the successive shock epochs, and define the inter-shock times T 0 = τ 0 and T n = τ n τ n 1 for n 1 . We assume the following:
  • The delay  T 0 has phase-type distribution PH ( α 0 , S 0 ) on a phase space E 0 of finite cardinality m 0 , with initial vector α 0 and sub-generator S 0 . We write s 0 = S 0 e for the absorption-rate vector.
  • The post-delay inter-shock times  T 1 , T 2 , are i.i.d. phase-type PH ( α , S ) on a phase space E = { 1 , , m } , with initial vector α and sub-generator S. We write s = S e .
  • The phase process underlying the post-delay inter-shock times is denoted { J ( t ) } t τ 0 . By construction J ( τ n ) α for each n 0 , and the phase evolution between τ n and τ n + 1 is the standard PH dynamics governed by S.
Remark 1 
(On the distinction between T 0 and T 1 , T 2 , ). The delay T 0 and the post-delay inter-shock times { T n } n 1 are allowed to have distinct phase-type distributions ( PH ( α 0 , S 0 ) versus PH ( α , S ) , possibly on different phase spaces). This distinction is operationally meaningful in reliability engineering. The renewal sequence { T n } n 1 describes the long-run inter-arrival law of stress events on a system in steady operating conditions, while the delay T 0 describes the time from the start of monitoring (e.g., system commissioning, deployment, or the moment of installation) until the first stress event is observed. These two distributions typically differ in three settings of practical interest. (i) Equilibrium effects. Even when the stress arrivals follow a renewal process in the long run, time-to-first-event from an arbitrary starting epoch follows the renewal equilibrium distribution rather than the inter-arrival law, with mean E [ T 1 2 ] / ( 2 E [ T 1 ] ) rather than E [ T 1 ] . (ii) Burn-in and infant-mortality periods. Newly commissioned systems often experience either elevated or suppressed stress rates relative to steady-state operation, depending on protective measures during early service. (iii) Shelf-storage effects. For components stored before deployment (e.g., aerospace spares, semiconductor inventory), the period before the first in-service stress event reflects storage conditions distinct from the in-service environment. The phase-type structure of T 0 allows the framework to accommodate any of these scenarios without modification. In applications where no such distinction is needed, setting PH ( α 0 , S 0 ) = PH ( α , S ) recovers a pure renewal model.

2.1.2. Damage Sizes

The shocks deposit non-negative integer damage:
  • The initial damage  X 0 at the first shock has a probability generating function (PGF) a 0 ( u ) = E [ u X 0 ] for | u | 1 .
  • The post-initial damage sizes  X 1 , X 2 , are i.i.d. in Z + with PGF a ( u ) = E [ u X 1 ] .
  • The damage sequence { X n } n 0 is independent of the inter-shock time sequence { T n } n 0 and of the phase process { J ( t ) } .
  • The cumulative damage is S n = X 0 + X 1 + + X n for n 0 , with S 1 : = 0 by convention.
Remark 2 
(On integer-valued damage). We model damage as non-negative integer-valued for three reasons. First, many shock-driven reliability mechanisms produce intrinsically discrete damage: numbers of microcracks, defect counts, voltage-spike-induced bit flips in semiconductor devices, fatigue cycles to crack initiation, and impact counts in mechanical wear. Second, the integer formulation aligns directly with the marked-point-process and matrix-analytic literature on shock models [1,3,5,17], where PGFs are the standard analytical tool. Third, integer damage permits the threshold-truncation algebra of the D -operator (see Definition 2 below), which is the central technical device enabling closed-form expressions throughout the paper.
The framework extends to continuous damage X n [ 0 , ) by replacing the PGF a ( u ) = E [ u X n ] with the Laplace transform a ˜ ( η ) = E [ e η X n ] throughout, with the threshold p 1 becoming real-valued and the D -operator replaced by a contour-integral analogue [6]. The structural results of the paper carry over, although the rational-function computational shortcuts of Appendix B require the discrete formulation. Discrete-time damage covers many engineering settings of interest and yields the cleanest theory; we develop it here and note the continuous extension as a direction for future work.

2.1.3. Failure

Fix an integer failure threshold M N and write p 1 = M 1 Z + . The failure index is the first n for which the cumulative damage strictly exceeds p 1 :
ν = inf { n 0 : S n > p 1 } .
The auxiliary quantity p 1 = M 1 is an indexing convenience that converts the failure event from a non-strict inequality S n M to the strict inequality S n > p 1 used in (1). Working with p 1 rather than M throughout simplifies the generating-function manipulations that appear in Section 3 and Section 4: in particular, indicator functions of the form 1 { S n p 1 } are encoded cleanly via the D -operator (cf. Proposition 2 below) as D x p 1 { x S n } . This convention follows [5,6] and the subsequent fluctuation-analysis literature. Under the standing Assumption 1 below ν < almost surely. The system fails at the random epoch τ ν , with cumulative damage S ν > p 1 . The quantities of primary interest are
τ ν ( failure time ) , S ν ( damage at failure ) ,
τ ν 1 ( p r e - f a i l u r e time ) , S ν 1 ( p r e - f a i l u r e damage ) ,
together with the phase J ( τ ν ) at the failure epoch.

2.1.4. Pre-Failure Conventions at ν = 0

When ν = 0 (the first shock immediately exceeds the threshold), we set S 1 = 0 and τ 1 = 0 . This convention matches [3,5], and ensures all generating-function expressions remain well-defined.
Assumption 1 
(Standing assumptions). Throughout the paper, we assume the following:
(A1) 
P ( X 1 1 ) > 0  , so that  a ( u ) 1 ;
(A2) 
μ A : = E [ X 1 ] = a ( 1 ) <  and  E [ X 0 ] = a 0 ( 1 ) < ;
(A3) 
μ T : = E [ T 1 ] = α S 1 e <  and  μ T 0 : = E [ T 0 ] = α 0 S 0 1 e < .
These conditions are sufficient to ensure that ν < a.s. (since cumulative damage drifts to + whenever P ( X 1 1 ) > 0 ) and that all moments computed in Section 4 are finite. The assumptions are the natural reliability counterparts of those in [16] (Assumption 3.2).
Remark 3 
(Reliability interpretation of the phase process). The phase  J ( t )  admits several reliability interpretations:
(i) 
As an environmental stress regime modulating the rate of shock arrivals, in which case different phases correspond to different operating conditions (e.g., “high-stress” versus “low-stress” periods);
(ii) 
As an internal degradation phase of the system itself, when the inter-shock time distribution captures progressive deterioration in shock susceptibility;
(iii) 
As a purely algebraic device for representing a non-exponential inter-shock distribution as a phase-type approximation, with the  H ( θ )  formalism providing matrix tractability without claiming intrinsic physical meaning for the phases.
The framework developed below is agnostic to which interpretation the user adopts; the closed-form reliability indices we derive are valid in all three settings.

2.2. Phase-Type Machinery

We summarize the phase-type tools used in the paper; these are standard [9,10], and we record them here mainly to fix notation.
Definition 1 
(Scalar and matrix LSTs). The scalar Laplace–Stieltjes transform (LST) of T n PH ( α , S ) for n 1 is
h ( θ ) = E [ e θ T 1 ] = α ( θ I S ) 1 s , Re ( θ ) 0 ,
 and the matrix LST is
H ( θ ) = ( θ I S ) 1 s α = v ( θ ) α , v ( θ ) : = ( θ I S ) 1 s .
 The corresponding scalar and matrix LSTs of the delay T 0 PH ( α 0 , S 0 ) are denoted h 0 ( θ ) and H 0 ( θ ) respectively, with h 0 ( θ ) = α 0 ( θ I S 0 ) 1 s 0 .
The matrix LST H ( θ ) encodes the joint distribution of the duration T 1 and the phase J ( τ 1 ) : writing J ( τ 0 ) = i for the conditioning phase at the start of T 1 ,
[ H ( θ ) ] i j = E e θ T 1 1 { J ( τ 1 ) = j } | J ( τ 0 ) = i .
The following properties are standard [16] (Proposition 3.4).
Proposition 1 
(Properties of the matrix LST). For all θ with  Re ( θ ) 0 :
(i) 
h ( θ ) = α H ( θ ) e ;
(ii) 
H ( θ ) = v ( θ ) α  has rank one;
(iii) 
Idempotent identity:  H ( θ ) 2 = h ( θ ) H ( θ ) ;
(iv) 
H ( 0 ) = e α ;
(v) 
Sherman–Morrison identity: for  | c | | h ( θ ) | < 1 ,
( I c H ( θ ) ) 1 = I + c 1 c h ( θ ) H ( θ ) .
Remark 4 
(On the Sherman–Morrison identity). The Sherman–Morrison identity (4) is a special case of the classical formula [18] for the inverse of a rank-one perturbation of the identity matrix. The general statement is  ( I + u v ) 1 = I u v / ( 1 + v u )  for column vectors  u , v ; in our setting, the rank-one matrix is  c H ( θ ) = c v ( θ ) α , and the scalar  v u = c α v ( θ ) = c h ( θ ) . The probabilistic content is that the matrix-valued geometric series  n 0 [ ξ a ( u ) H ( θ ) ] n  encountered in Section 3 collapses to a single rank-one update of the identity: rather than computing a full  m × m  matrix inverse at each step, only the scalar  h ( θ )  governs the resummation. This is what permits closed-form expressions for the reliability functional even when the phase space has many states.
A second identity, mixing the delay and post-delay LSTs, will be used repeatedly in Section 3.
Lemma 1 
(Mixed-LST identity). For any ω , θ with Re ( ω ) , Re ( θ ) 0 :
H ( ω ) H ( θ ) = h ( θ ) H ( ω ) .
Proof. 
Using H ( ω ) = v ( ω ) α and H ( θ ) = v ( θ ) α ,
H ( ω ) H ( θ ) = v ( ω ) ( α v ( θ ) ) α = h ( θ ) v ( ω ) α = h ( θ ) H ( ω ) ,
since α v ( θ ) = h ( θ ) is a scalar. The asymmetry between ω and θ in (5) is intrinsic to the algebra: the inner product α v ( θ ) in the middle expression evaluates to the scalar h ( θ ) (carrying the argument of the rightmost factor), while the outer factors v ( ω ) and α survive to produce H ( ω ) (carrying the argument of the leftmost factor). The argument θ in h ( θ ) is therefore inherited from the right-hand H ( θ ) and is the same scalar LST h ( θ ) = α H ( θ ) e of Proposition 1(i).    □
Lemma 1 reduces to Proposition 1(iii) when ω = θ . It is the key algebraic tool that produces the three-dimensional span structure of Φ ν in Section 3.

2.3. The D -Operator

The truncation constraints arising from the failure index ν are most cleanly expressed via the operator introduced by [6].
Definition 2 
( D -operator). For a function f analytic at the origin and a non-negative integer k,
D x k { f ( x ) } = lim x 0 1 k ! k x k f ( x ) 1 x .
Equivalently, if f ( x ) = j 0 c j x j is the Taylor expansion of f at 0, then
D x k { f ( x ) } = j = 0 k c j .
This characterization makes D x k a linear functional that extracts the partial sum of Taylor coefficients up to order k. It admits a probabilistic reading: when f ( x ) is the PGF of a non-negative integer random variable X, D x k { f ( x ) } = P ( X k ) .
Remark 5 
(Why the D -operator is the right tool). The D -operator encodes the threshold-truncation constraint { S n p 1 } in a way that interacts cleanly with generating-function manipulations. Three properties make it essential to the framework. First, since 1 { S k } = D x k { x S } for any non-negative integer S, indicator functions of the form “cumulative damage has not yet crossed the threshold” become D -images of PGFs that can be summed, multiplied, and differentiated like ordinary analytic expressions. Second, by the Taylor characterization (7), the D -operator commutes with linear operations and matrix-valued constants (Proposition 2 below); this lets us apply D x p 1 to matrix expressions involving H ( θ ) by acting only on the scalar coefficients. Third, when the PGFs a 0 , a are rational, the D -image reduces to a finite Taylor-coefficient extraction computable in O ( p 1 ) arithmetic operations via the recurrence detailed in Appendix B. The closed-form reliability indices of Section 4 are therefore not only analytically clean but also numerically inexpensive.
The following properties are direct consequences of (7); we refer to [16] (Proposition 3.5) for proofs.
Proposition 2 
(Properties of D x k ).
(P1) 
Linearity: D x k { c f + d g } = c D x k { f } + d D x k { g } for scalars c , d .
(P2) 
Constants: D x k { c } = c for any constant c.
(P3) 
Geometric series: with δ ( j , k ) = 1 { j k } ,
D x k x j 1 γ x = δ ( j , k ) 1 γ k j + 1 1 γ , | γ | < 1 .
(P4) 
Matrix-valued extension: if F ( x ) = f 1 ( x ) M 1 + f 2 ( x ) M 2 with f 1 , f 2 scalar and M 1 , M 2 constant matrices, then
D x k { F ( x ) } = D x k { f 1 ( x ) } M 1 + D x k { f 2 ( x ) } M 2 .
The matrix-valued extension (P4) will allow us to apply D x p 1 to expressions involving H ( θ ) and H ( ω ) in Section 3 by acting on the scalar Sherman–Morrison decomposition.

2.4. The Phase-Tagged Reliability Functional

We now define the central object of the paper.
Definition 3 
(Phase-tagged reliability functional). The phase-tagged reliability functional is the m × m matrix
Φ ν ( ξ , u , v , ϑ , θ ) = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 e θ τ ν ; J ( τ ν ) | J ( τ 0 ) ,
 whose ( i , j ) entry is
[ Φ ν ( ξ , u , v , ϑ , θ ) ] i j = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 e θ τ ν 1 { J ( τ ν ) = j } | J ( τ 0 ) = i ,
 defined for | ξ | 1 , | u | 1 , | v | 1 , Re ( ϑ ) 0 , Re ( θ ) 0 , and i , j E .
Remark 6 
(Meaning of the five transform variables). Each of the five transform variables encodes one reliability quantity:
ξ    PGF variable for the failure index  ν ;
u   PGF variable for the pre-failure damage  S ν 1 ;
v   PGF variable for the failure damage  S ν ;
ϑ    LST variable for the pre-failure time  τ ν 1 ;
θ    LST variable for the failure time  τ ν .
The matrix indices i , j track the phase at the first shock (conditioning) and the phase at failure (the new tag), respectively. The functional encodes, in a single matrix-valued object, the joint distribution of all six reliability quantities ( ν , τ ν 1 , τ ν , S ν 1 , S ν , J ( τ ν ) ) .
Remark 7 
(Conditioning convention). We adopt the conditioning convention of [16]: the matrix index i specifies the phase J ( τ 0 ) at the first shock epoch, not the phase at calendar time zero. Under this convention, the delay T 0 contributes its scalar duration h 0 ( · ) as a prefactor; the matrix tracking begins from τ 0 . Reliability-wise, this corresponds to observing the system from the moment of its first shock onwards, with the pre-shock phase dynamics absorbed into the scalar delay LST.

2.5. Recovery of Existing Scalar Functionals

The matrix-valued Φ ν generalizes two scalar objects in the literature, providing a quick consistency benchmark for the main results in Section 3.

2.5.1. Recovery of the Tadj Phase-Tagged First Excess Functional

The functional Ψ ( ξ , θ , u ) of [16] (Definition 4.1) tracks only the failure-time damage and the failure time. It is recovered by setting u Φ ν = 1 and ϑ = 0 in Definition 3, with v Φ ν = u Ψ :
Φ ν ( ξ , 1 , u , 0 , θ ) = Ψ ( ξ , θ , u ) .
A formal proof of (10) is given as Theorem 3 in Section 3.

2.5.2. Recovery of the Dshalalow–White Scalar Reliability Functional

The scalar functional Φ ν ( ξ , u , v , ϑ , θ ) of [3] (Theorem 1, Equation (5)) (in the independence case) is recovered by sandwiching Φ ν between the initial vector and the column of ones:
α Φ ν ( ξ , u , v , ϑ , θ ) e = Φ ν DW ( ξ , u , v , ϑ , θ ) .
A formal proof appears as Theorem 4 in Section 3.
These two recovery relations situate Φ ν between the scalar fluctuation theory of Dshalalow and the phase-tagged framework of Tadj: Φ ν is the matrix-lift of Φ ν DW , equivalently the pre-failure-enriched extension of Ψ .

3. The Main Theorem

This section establishes the closed form for the phase-tagged reliability functional Φ ν defined in Definition 3. We proceed in five steps: the trajectory decomposition (Section 3.1), the immediate-excess contribution (Section 3.2), the delayed-excess contribution (Section 3.3), the main closed-form theorem (Section 3.4), and the structural and consistency results that follow (Section 3.5).

3.1. Trajectory Decomposition

By the very definition of the failure index ν in (1), the events { ν = 0 } and { ν 1 } partition the sample space. We split Φ ν accordingly.
Lemma 2 
(Trajectory decomposition).  Φ ν = Φ ν ( 0 ) + Φ ν ( + ) , where the contributions Φ ν ( 0 ) and Φ ν ( + ) from { ν = 0 } and { ν 1 } respectively have ( i , j ) entries
[ Φ ν ( 0 ) ( ξ , u , v , ϑ , θ ) ] i j = E v X 0 e θ τ 0 1 { X 0 > p 1 } 1 { J ( τ 0 ) = j } | J ( τ 0 ) = i ,
[ Φ ν ( + ) ( ξ , u , v , ϑ , θ ) ] i j = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 θ τ ν 1 { ν 1 } 1 { J ( τ ν ) = j } | J ( τ 0 ) = i .
Proof. 
By Assumption 1 we have ν < a.s., so the events { ν = 0 } and { ν 1 } form a partition of the sample space (up to a null set). From the definition of Φ ν in (8),
[ Φ ν ] i j = E ξ ν u S ν 1 v S ν e ϑ τ ν 1 θ τ ν 1 { J ( τ ν ) = j } | J ( τ 0 ) = i ,
which we split as
[ Φ ν ] i j = E [ 1 { ν = 0 } J ( τ 0 ) = i + E [ 1 { ν 1 } J ( τ 0 ) = i ,
yielding Φ ν ( 0 ) + Φ ν ( + ) . On the event { ν = 0 } , the conventions S 1 = τ 1 = 0 give ξ 0 u S 1 e ϑ τ 1 = 1 and S 0 = X 0 , τ 0 = T 0 ; furthermore { ν = 0 } = { X 0 > p 1 } since X 0 = S 0 . Substituting yields (12). The expression (13) is the corresponding restriction to { ν 1 } .    □
The ξ 0 = 1 , u S 1 = 1 , e ϑ τ 1 = 1 simplifications used in (12) reflect the convention S 1 = τ 1 = 0 at ν = 0 .

3.2. The Immediate-Excess Contribution

Lemma 3 
(Immediate-excess contribution).
Φ ν ( 0 ) ( ξ , u , v , ϑ , θ ) = h 0 ( θ ) a 0 ( v ) d 1 a 0 ( v ) I ,
where the truncated PGF
d 1 a 0 ( v ) : = E [ v X 0 1 { X 0 p 1 } ] = k = 0 p 1 P ( X 0 = k ) v k
captures the head of X 0 truncated at p 1 .
Proof. 
We evaluate the ( i , j ) entry (12) of Φ ν ( 0 ) by computing each factor under the conditioning J ( τ 0 ) = i . Conditional on J ( τ 0 ) = i , the post-shock indicator 1 { J ( τ 0 ) = j } in (12) is simply δ i j . The factor X 0 is independent of the time process by Assumption 1 (and the model specification), so
[ Φ ν ( 0 ) ] i j = E [ v X 0 1 { X 0 > p 1 } ] · E [ e θ τ 0 ] · δ i j = a 0 ( v ) d 1 a 0 ( v ) h 0 ( θ ) δ i j ,
using E [ v X 0 1 { X 0 > p 1 } ] = E [ v X 0 ] E [ v X 0 1 { X 0 p 1 } ] = a 0 ( v ) d 1 a 0 ( v ) and E [ e θ τ 0 ] = E [ e θ T 0 ] = h 0 ( θ ) from Definition 1. Since this holds for all i , j , we obtain (14) in matrix form.    □
The variables ξ , u, ϑ do not appear in Φ ν ( 0 ) , in line with the convention that pre-failure quantities are zero at ν = 0 .

3.3. The Delayed-Excess Contribution

We now evaluate Φ ν ( + ) in closed form.
Lemma 4 
(Delayed-excess contribution). With w = u v and ω = ϑ + θ ,
Φ ν ( + ) ( ξ , u , v , ϑ , θ ) = h 0 ( ω ) D x p 1 ξ a 0 ( w x ) [ a ( v ) a ( v x ) ] H ( θ ) + ξ a ( w x ) h ( θ ) 1 ξ a ( w x ) h ( ω ) H ( ω ) .
Proof. 
The proof has four steps: combining the pre-failure and failure variables, encoding the threshold-crossing event via the D -operator, summing a matrix-valued geometric series, and applying the Sherman–Morrison identity (Proposition 1(v)) together with the mixed-LST identity (Lemma 1) to reach the stated closed form.
  • Step 1: Combining the pre-failure and failure variables.
For ν 1 we have S ν = S ν 1 + X ν and τ ν = τ ν 1 + T ν . Substituting:
ξ ν u S ν 1 v S ν e ϑ τ ν 1 θ τ ν = ξ ν ( u v ) S ν 1 v X ν e ( ϑ + θ ) τ ν 1 e θ T ν .
We introduce the auxiliary variables
w : = u v , ω : = ϑ + θ ,
which absorb the pre-failure transform variables into composite expressions. Under (19), Equation (18) becomes ξ ν w S ν 1 v X ν e ω τ ν 1 e θ T ν .
  • Step 2: Threshold-crossing event via the D -operator.
For ν 1 , the threshold-crossing event { S ν 1 p 1 , S ν > p 1 } admits the indicator decomposition
1 { S ν 1 p 1 , S ν > p 1 } = 1 { S ν 1 p 1 } 1 { S ν p 1 } ,
where we used { S ν p 1 } { S ν 1 p 1 } (since X ν 0 ). For any non-negative integer S, the threshold indicator can be encoded via the D -operator (cf. [6]):
1 { S p 1 } = D x p 1 x S .
Combining (20) and (21):
1 { S ν 1 p 1 , S ν > p 1 } = D x p 1 x S ν 1 x S ν = D x p 1 x S ν 1 ( 1 x X ν ) .
Step 3: The matrix-valued geometric series.
The event { ν 1 } decomposes into the disjoint union n 1 { ν = n } . On { ν = n } , the threshold-crossing indicator (22) reads D x p 1 { x S n 1 ( 1 x X n ) } , and the integrand of (13) becomes the Step 1 expression with ν replaced by n. Summing over n 1 and inserting (22):
Φ ν ( + ) = n = 1 ξ n E w S n 1 v X n e ω τ n 1 e θ T n D x p 1 x S n 1 ( 1 x X n ) ; J ( τ n ) | J ( τ 0 ) = D x p 1 n = 1 ξ n E ( w x ) S n 1 v X n ( v x ) X n e ω τ n 1 e θ T n ; J ( τ n ) | J ( τ 0 ) ,
using linearity of D x p 1 to bring it outside the expectation and the sum, and identifying w S n 1 · x S n 1 = ( w x ) S n 1 and v X n · x X n = ( v x ) X n . The interchange of D x p 1 with the infinite sum is justified by absolute convergence of the series for | ξ | < 1 and bounded inputs | u | 1 , | v | 1 , Re ( ω ) , Re ( θ ) 0 : each term has modulus bounded by | ξ | n times a uniformly bounded quantity, so the series converges uniformly on compact subsets of the polydisc, and D x p 1 is a continuous linear functional on this class [16] (Proposition 3.5).
By independence of damage and time (and of the phase process) and the renewal structure of the inter-shock times, the inner expectation factors are as follows. Conditioning on J ( τ n 1 ) = k and using the Markov property at τ n 1 :
E ( w x ) S n 1 v X n ( v x ) X n e ω τ n 1 e θ T n 1 { J ( τ n ) = j } | J ( τ 0 ) = i = k E ( w x ) S n 1 e ω τ n 1 1 { J ( τ n 1 ) = k } | J ( τ 0 ) = i = : [ Q ( n 1 ) ( w x , ω ) ] i k × E v X n ( v x ) X n e θ T n 1 { J ( τ n ) = j } | J ( τ n 1 ) = k = [ a ( v ) a ( v x ) ] [ H ( θ ) ] k j .
The second factor uses the independence X n T n J and the matrix-LST representation of Definition 1: E [ v X n ( v x ) X n ] = a ( v ) a ( v x ) and E [ e θ T n ; J ( τ n ) | J ( τ n 1 ) = k ] = H ( θ ) k j .
The trajectory generating function Q ( n 1 ) ( y , ω ) has a clean closed form. For n = 1 , the trajectory ( X 0 , T 0 ) alone contributes: E [ y X 0 e ω T 0 1 { J ( τ 0 ) = k } | J ( τ 0 ) = i ] = E [ y X 0 ] E [ e ω T 0 ] δ i k = a 0 ( y ) h 0 ( ω ) δ i k , since X 0 T 0 and the indicator collapses to the Kronecker delta under the conditioning. Hence, Q ( 0 ) ( y , ω ) = a 0 ( y ) h 0 ( ω ) I . For n 2 , each subsequent step ( X k , T k ) for 1 k n 1 contributes a multiplicative matrix factor a ( y ) H ( ω ) by the standard Markov-renewal argument: conditional on J ( τ k 1 ) = , the joint transform E [ y X k e ω T k 1 { J ( τ k ) = } | J ( τ k 1 ) = ] = a ( y ) [ H ( ω ) ] by independence of X k from the time-phase pair ( T k , J ) and from previous variables (cf. [16], Lemma 4.4). Combining these factors gives
Q ( n 1 ) ( y , ω ) = a 0 ( y ) h 0 ( ω ) a ( y ) H ( ω ) n 1 , n 1 .
Step 4: Closed form via Sherman–Morrison.
Substituting (24) with y = w x into (23):
Φ ν ( + ) = D x p 1 a 0 ( w x ) h 0 ( ω ) n = 1 ξ n a ( w x ) H ( ω ) n 1 [ a ( v ) a ( v x ) ] H ( θ ) .
Pull h 0 ( ω ) outside (it does not depend on x) and recognize the matrix-valued geometric series:
n = 1 ξ n a ( w x ) H ( ω ) n 1 = ξ I ξ a ( w x ) H ( ω ) 1 .
Convergence of this series requires ξ a ( w x ) H ( ω ) < 1 with respect to the operator norm; this is ensured by | ξ | < 1 , | a ( w x ) | 1 on the unit polydisc, and H ( ω ) 1 for Re ( ω ) 0 (since H ( ω ) is dominated entrywise by the stochastic matrix H ( 0 ) = e α ).
Apply the Sherman–Morrison identity (4) with c = ξ a ( w x ) and H = H ( ω ) :
I ξ a ( w x ) H ( ω ) 1 = I + ξ a ( w x ) 1 ξ a ( w x ) h ( ω ) H ( ω ) .
Therefore
Φ ν ( + ) = h 0 ( ω ) D x p 1 ξ a 0 ( w x ) [ a ( v ) a ( v x ) ] H ( θ ) + ξ a ( w x ) H ( ω ) H ( θ ) 1 ξ a ( w x ) h ( ω ) .
Finally, applying Lemma 1 ( H ( ω ) H ( θ ) = h ( θ ) H ( ω ) ) collapses the second matrix term to give (17).    □

3.4. The Closed-Form Theorem

Combining Lemmas 3 and 4 via Lemma 2 yields the central result of the paper.
Theorem 1 
(Phase-Tagged Reliability Formula). Under Assumption 1, for | ξ | 1 , | u | 1 , | v | 1 , and Re ( ϑ ) , Re ( θ ) 0 ,
Φ ν ( ξ , u , v , ϑ , θ ) = h 0 ( θ ) a 0 ( v ) d 1 a 0 ( v ) I + h 0 ( ω ) D x p 1 ξ a 0 ( u v x ) [ a ( v ) a ( v x ) ] H ( θ ) + ξ a ( u v x ) h ( θ ) 1 ξ a ( u v x ) h ( ω ) H ( ω ) ,
 where ω = ϑ + θ and d 1 a 0 ( v ) is defined in (15).
Proof. 
By Lemma 2, Φ ν = Φ ν ( 0 ) + Φ ν ( + ) , where the contributions from { ν = 0 } and { ν 1 } are given by (12) and (13) respectively. Lemma 3 evaluates Φ ν ( 0 ) = h 0 ( θ ) ( a 0 ( v ) d 1 a 0 ( v ) ) I , which becomes the first summand on the right-hand side of (29). Lemma 4, with the substitutions w = u v and ω = ϑ + θ , evaluates Φ ν ( + ) to the second summand. Adding the two contributions and replacing w = u v inside the D -argument yields (29). The domain conditions | ξ | 1 , | u | 1 , | v | 1 , Re ( ϑ ) , Re ( θ ) 0 ensure that all series converge and that all matrix inverses are well defined, by the bounds noted in the proof of Lemma 4.    □
Theorem 1 expresses the entire joint distribution of ( ν , S ν 1 , S ν , τ ν 1 , τ ν , J ( τ ν ) ) in a single matrix formula. The remaining sections of the paper extract concrete reliability indices from (29) and verify two consistency relations.

3.5. Span Structure and Consistency Results

The formula (29) reveals an interesting algebraic feature: the matrix Φ ν , despite having dimension m × m , lies in a low-dimensional matrix subspace.
Theorem 2 
(Three-dimensional span). For all admissible ( ξ , u , v , ϑ , θ ) ,
Φ ν ( ξ , u , v , ϑ , θ ) span { I , H ( θ ) , H ( ω ) } ,
i.e., there exist scalar functions ϕ 1 , ϕ 2 , ϕ 3 such that
Φ ν = ϕ 1 ( ξ , u , v , ϑ , θ ) I + ϕ 2 ( ξ , u , v , ϑ , θ ) H ( θ ) + ϕ 3 ( ξ , u , v , ϑ , θ ) H ( ω ) ,
with explicit expressions
ϕ 1 = h 0 ( θ ) a 0 ( v ) d 1 a 0 ( v ) ,
ϕ 2 = h 0 ( ω ) D x p 1 ξ a 0 ( u v x ) [ a ( v ) a ( v x ) ] ,
ϕ 3 = h 0 ( ω ) h ( θ ) D x p 1 ξ 2 a 0 ( u v x ) a ( u v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( u v x ) h ( ω ) .
When ϑ = 0 the matrices H ( θ ) and H ( ω ) coincide, and the span collapses to span { I , H ( θ ) } , recovering the two-dimensional span structure of [16] (Theorem 4.6).
Proof. 
The expression (29) is already a sum of one I-term, one H ( θ ) -term, and one H ( ω ) -term. The D -operator acts only on the scalar coefficients in each term (cf. Proposition 2(P4)), yielding the Formulas (32)–(34). The collapse at ϑ = 0 is immediate from ω = θ .    □
Remark 8 
(Probabilistic role of the third dimension). The third basis element H ( ω ) encodes the joint dependence of failure-time and pre-failure-time tracking via the composite variable ω = ϑ + θ . Without pre-failure-time tracking ( ϑ = 0 ), there is only one time variable in play, and the span reduces to two dimensions, matching the result of [16]. This three-dimensional structure is therefore intrinsic to the joint pre-failure- and post-failure-time distribution rather than an artifact of the matrix-analytic representation.
We now record the two consistency results promised in Section 2.5, demonstrating that Φ ν correctly extends both the Tadj phase-tagged framework and the Dshalalow–White scalar fluctuation formula.
Theorem 3 
(Recovery of the Tadj phase-tagged functional). Setting u = 1 and ϑ = 0 in (29) yields, after simplification,
Φ ν ( ξ , 1 , v , 0 , θ ) = Ψ ( ξ , θ , v ) ,
 where Ψ ( ξ , θ , v ) is the phase-tagged first excess functional of [16] (Theorem 4.5).
Proof. 
With u = 1 and ϑ = 0 we have w = v and ω = θ . The bracket in (29) becomes
H ( θ ) + ξ a ( v x ) h ( θ ) 1 ξ a ( v x ) h ( θ ) H ( θ ) = H ( θ ) 1 ξ a ( v x ) h ( θ ) ,
and the formula reduces to
Φ ν ( ξ , 1 , v , 0 , θ ) = h 0 ( θ ) ( a 0 ( v ) d 1 a 0 ( v ) ) I + D x p 1 ξ a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( v x ) h ( θ ) H ( θ ) .
The right-hand side of (36) is algebraically equivalent to the central formula of [16] (Theorem 4.5),
1 h 0 ( θ ) Ψ ( ξ , θ , v ) = a 0 ( v ) I ( I ξ a ( v ) H ( θ ) ) D x p 1 a 0 ( v x ) I ξ a ( v x ) H ( θ ) ,
via the identity (cf. Appendix A, Lemma A1)
D x p 1 ξ a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( v x ) h ( θ ) = ξ a ( v ) d 1 a 0 ( v ) 1 ξ a ( v ) h ( θ ) d 2 ( ξ , θ , v ) ,
where d 2 ( ξ , θ , v ) = D x p 1 ξ a 0 ( v x ) a ( v x ) / ( 1 ξ a ( v x ) h ( θ ) ) is the auxiliary scalar of [16].    □
Theorem 4 
(Recovery of the Dshalalow–White scalar functional). The scalar projection α Φ ν ( ξ , u , v , ϑ , θ ) e equals the Dshalalow–White scalar reliability functional Φ ν DW ( ξ , u , v , ϑ , θ ) of [3] (Equation (5)) in the independence case.
Proof. 
By Proposition 1(i), α I e = 1 , α H ( θ ) e = h ( θ ) , and α H ( ω ) e = h ( ω ) . Sandwiching (29) between α and e :
α Φ ν e = h 0 ( θ ) a 0 ( v ) d 1 a 0 ( v ) + h 0 ( ω ) D x p 1 ξ a 0 ( u v x ) [ a ( v ) a ( v x ) ] h ( θ ) + ξ a ( u v x ) h ( θ ) h ( ω ) 1 ξ a ( u v x ) h ( ω ) .
The bracket simplifies to h ( θ ) / ( 1 ξ a ( u v x ) h ( ω ) ) . Thus
α Φ ν e = h 0 ( θ ) a 0 ( v ) d 1 a 0 ( v ) + h 0 ( ω ) h ( θ ) D x p 1 ξ a 0 ( u v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( u v x ) h ( ω ) .
The right-hand side of (37) coincides with the Dshalalow–White formula [3] (Equation (5)) for a marked point process with independent marks; using their notation γ 0 ( z , η ) = a 0 ( z ) h 0 ( η ) and γ ( z , η ) = a ( z ) h ( η ) , Equation (5) of [3] reads
Φ ν DW = D x p 1 a 0 ( v ) h 0 ( θ ) a 0 ( v x ) h 0 ( θ ) + ξ a 0 ( u v x ) h 0 ( ω ) 1 ξ a ( u v x ) h ( ω ) a ( v ) h ( θ ) a ( v x ) h ( θ ) .
Linearity of D x p 1 and the identities D x p 1 { a 0 ( v ) } = a 0 ( v ) (constant in x) and D x p 1 { a 0 ( v x ) } = d 1 a 0 ( v ) reduce this to (37).    □
Theorems 3 and 4 jointly establish the position of Φ ν in the literature: it is the matrix-valued lift of the scalar Dshalalow–White functional, equivalently, the pre-failure-enriched extension of the Tadj phase-tagged functional. The two parallel proofs also serve as independent algebraic checks on Theorem 1: the central formula simultaneously satisfies a phase-tagged consistency relation and a scalar reliability consistency relation.

4. Reliability Indices

This section extracts concrete reliability quantities from the closed-form formula (29) of Theorem 1. The results fall into four groups: time-to-failure quantities (Section 4.1), damage-at-failure quantities (Section 4.2), pre-failure quantities (Section 4.3), and the phase-resolved failure analysis (Section 4.4). Two structural identities of Wald type emerge along the way.

4.1. Time-to-Failure Quantities

The Laplace–Stieltjes transform of the failure time follows from the scalar projection (37) by setting ξ = u = v = 1 and ϑ = 0 .
Theorem 5 
(Failure-time LST). The LST of the failure time τ ν is
F ^ τ ν ( θ ) : = E [ e θ τ ν ] = h 0 ( θ ) P ( X 0 > p 1 ) + h 0 ( θ ) h ( θ ) D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) h ( θ ) .
Proof. 
Substitute ξ = u = v = 1 , ϑ = 0 in (37): ω = θ , a 0 ( v ) d 1 a 0 ( v ) = 1 P ( X 0 p 1 ) = P ( X 0 > p 1 ) , a ( v ) a ( v x ) = 1 a ( x ) , a 0 ( u v x ) = a 0 ( x ) , a ( u v x ) = a ( x ) .    □
Corollary 1 
(Reliability function). The Laplace transform of the reliability function R ( t ) = P ( τ ν > t ) is
R ^ ( θ ) : = 0 e θ t R ( t ) d t = 1 F ^ τ ν ( θ ) θ .
The reliability function R ( t ) may be recovered by numerical inversion of R ^ ( θ ) , e.g., via the Gaver–Stehfest algorithm; see Section 5.
A central reliability index is the mean time to failure (MTTF). Its closed form admits a clean Wald-type interpretation.
Theorem 6 
(Wald’s identity for failure time). Let
E [ ν ] = D x p 1 a 0 ( x ) 1 a ( x ) .
Then
MTTF = E [ τ ν ] = μ T 0 + μ T E [ ν ] .
Proof. 
By definition MTTF = F ^ τ ν ( 0 ) . Differentiate (38) in θ , using h 0 ( 0 ) = h ( 0 ) = 1 , h 0 ( 0 ) = μ T 0 , h ( 0 ) = μ T , and the relation
d d θ D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) h ( θ ) | θ = 0 = h ( 0 ) D x p 1 a 0 ( x ) a ( x ) [ 1 a ( x ) ] [ 1 a ( x ) ] 2 = μ T D x p 1 a 0 ( x ) a ( x ) 1 a ( x ) .
Combining,
F ^ τ ν ( 0 ) = μ T 0 P ( X 0 > p 1 ) + μ T 0 P ( X 0 p 1 ) + μ T P ( X 0 p 1 ) + μ T D x p 1 a 0 ( x ) a ( x ) 1 a ( x ) .
The first two terms collapse to μ T 0 . For the remaining sum, observe that
P ( X 0 p 1 ) + D x p 1 a 0 ( x ) a ( x ) 1 a ( x ) = D x p 1 a 0 ( x ) + a 0 ( x ) a ( x ) 1 a ( x ) = D x p 1 a 0 ( x ) 1 a ( x ) = E [ ν ] ,
where we used D x p 1 { a 0 ( x ) } = P ( X 0 p 1 ) and the algebraic identity a 0 + a 0 a / ( 1 a ) = a 0 / ( 1 a ) . Hence, MTTF = μ T 0 + μ T E [ ν ] .    □
Theorem 6 states that the expected failure time decomposes additively as the expected delay plus the expected number of post-delay shocks until failure, weighted by the mean inter-shock time. This is the Wald identity adapted to a two-stage renewal structure: the delay T 0 contributes μ T 0 to the total mean, and each subsequent inter-shock interval contributes μ T , terminated by the random index ν .
Remark 9 
(Computation of E [ ν ] ). The expression (40) is fully explicit once a 0 and a are specified. When both are rational PGFs, E [ ν ] reduces to the partial sum of the first p 1 + 1 Taylor coefficients of a 0 ( x ) / ( 1 a ( x ) ) , computable in O ( p 1 ) arithmetic operations via the recurrence detailed in Appendix B. No iterative solution of a matrix equation is required.

4.2. Damage-at-Failure Quantities

A second Wald-type identity governs the cumulative damage at failure.
Theorem 7 
(Wald-type identity for cumulative damage).
E [ S ν ] = E [ X 0 ] + μ A E [ ν ] .
Proof. 
Differentiate the scalar projection (37) in v at ξ = u = v = 1 , ϑ = θ = 0 . The immediate-excess piece contributes E [ X 0 1 { X 0 > p 1 } ] . For the delayed-excess piece, parametrize
g ( v ) : = D x p 1 a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 a ( v x ) .
Direct computation (cf. Appendix C) yields, after the cross-cancellation x a 0 ( x ) a ( x ) / ( 1 a ( x ) ) + x a 0 ( x ) a ( x ) / ( 1 a ( x ) ) = 0 ,
g ( 1 ) = D x p 1 { x a 0 ( x ) } + μ A D x p 1 a 0 ( x ) 1 a ( x ) = E [ X 0 1 { X 0 p 1 } ] + μ A E [ ν ] .
Combining the two pieces:
E [ S ν ] = E [ X 0 1 { X 0 > p 1 } ] + E [ X 0 1 { X 0 p 1 } ] + μ A E [ ν ] = E [ X 0 ] + μ A E [ ν ] .
   □
Corollary 2 
(Mean overshoot). The mean overshoot at failure is
E [ S ν p 1 ] = E [ X 0 ] p 1 + μ A E [ ν ] .
The mean overshoot quantifies how much the cumulative damage exceeds the threshold at the moment of failure. In reliability terms, it measures the “severity” of failure: a small overshoot indicates the system was operating near the threshold, whereas a large overshoot indicates a single catastrophic shock.
Remark 10 
(Comparison of the two Wald identities). Theorems 6 and 7 have parallel forms: MTTF = μ T 0 + μ T E [ ν ] and E [ S ν ] = E [ X 0 ] + μ A E [ ν ] . Both express a total mean as the sum of an “initial” contribution plus a renewal-style accumulation governed by E [ ν ] . The common factor E [ ν ] links the time and damage scales, making it the most fundamental scalar quantity of the model.

4.3. Pre-Failure Quantities

The transform variables u and ϑ in Φ ν allow direct extraction of pre-failure quantities: the state of the system at the last surviving moment before the failure-causing shock. These quantities are operationally meaningful for maintenance planning: they answer the question, “how close was the system to the threshold just before it failed?”
Proposition 3 
(Mean pre-failure damage).
E [ S ν 1 ] = E [ X 0 1 { X 0 p 1 } ] + D x p 1 x a 0 ( x ) a ( x ) 1 a ( x ) .
Proof. 
Differentiate the scalar projection (37) in u at ξ = v = 1 , ϑ = θ = 0 . The immediate-excess piece is u-independent (since S 1 = 0 ), so it contributes 0. The delayed-excess piece, after computing u [ a 0 ( u x ) ( 1 a ( x ) ) / ( 1 a ( u x ) ) ] | u = 1 and applying D x p 1 , yields the stated formula.    □
Proposition 4 
(Mean pre-failure time).
E [ τ ν 1 ] = μ T 0 P ( X 0 p 1 ) + μ T E [ ν ] P ( X 0 p 1 ) .
Proof. 
Differentiate Φ ν ( ξ = u = v = 1 , ϑ , θ = 0 ) in ϑ and apply 1 . The immediate-excess piece does not depend on ϑ . The delayed-excess piece depends on ϑ only through ω = ϑ , and the differentiation parallels the proof of Theorem 6 with the substitutions h 0 ( θ ) h 0 ( ω ) , h ( θ ) 1 . After simplification using D x p 1 { a 0 ( x ) a ( x ) / ( 1 a ( x ) ) } = E [ ν ] P ( X 0 p 1 ) , Equation (45) follows.    □
Corollary 3 
(Mean failure-causing inter-shock interval).
E [ τ ν τ ν 1 ] = μ T 0 P ( X 0 > p 1 ) + μ T P ( X 0 p 1 ) .
Proof. 
E [ τ ν τ ν 1 ] = MTTF E [ τ ν 1 ] . Substitute (41) and (45), simplify.    □
The expression (46) has a transparent interpretation: with probability P ( X 0 > p 1 ) , the system fails on the first shock, in which case the interval τ ν τ ν 1 = T 0 has mean μ T 0 ; otherwise, the failure-causing shock arrives after a generic post-delay interval of mean μ T .
Corollary 4 
(Mean failure-causing shock magnitude).
E [ X ν ] = E [ S ν ] E [ S ν 1 ] = E [ X 0 1 { X 0 > p 1 } ] + μ A E [ ν ] D x p 1 x a 0 ( x ) a ( x ) 1 a ( x ) .
This is the expected magnitude of the shock that causes failure. Generally E [ X ν ] > μ A , since X ν is conditioned to be large enough to push the cumulative damage past the threshold.
For applications requiring the full bivariate distributions, the joint transforms are available directly from (37).
Proposition 5 
(Joint transforms). The joint LST of ( τ ν 1 , τ ν ) and the joint PGF of ( S ν 1 , S ν )  are
E e ϑ τ ν 1 θ τ ν = h 0 ( θ ) P ( X 0 > p 1 ) + h 0 ( ω ) h ( θ ) D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) h ( ω ) ,
E u S ν 1 v S ν = a 0 ( v ) d 1 a 0 ( v ) + D x p 1 a 0 ( u v x ) [ a ( v ) a ( v x ) ] 1 a ( u v x ) .
Proof. 
Set ξ = u = v = 1 in (37) for (48); set ξ = 1 , ϑ = θ = 0 for (49).    □

4.4. Phase-Resolved Failure Analysis

We turn now to the phase-tagged contribution of the framework: the joint distribution of the failure time and the operational phase at the moment of failure. To our knowledge, no closed-form expression for these quantities has previously appeared in the reliability literature.
Theorem 8 
(Phase distribution at failure). For all i , j E ,
P J ( τ ν ) = j | J ( τ 0 ) = i = P ( X 0 > p 1 ) δ i j + P ( X 0 p 1 ) α j .
Proof. 
Set ξ = u = v = 1 , ϑ = θ = 0 in (29): ω = 0 , and by Proposition 1(iv), H ( 0 ) = H ( ω ) = e α . The bracket becomes
H ( θ ) + ξ a ( u v x ) h ( θ ) 1 ξ a ( u v x ) h ( ω ) H ( ω ) = e α + a ( x ) 1 a ( x ) e α = e α 1 a ( x ) .
The delayed-excess part of (29) thus becomes
D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) e α = D x p 1 { a 0 ( x ) } e α = P ( X 0 p 1 ) e α .
Adding the immediate-excess piece P ( X 0 > p 1 ) I gives (50) entrywise.    □
Theorem 8 admits a remarkably clean operational interpretation. With probability P ( X 0 > p 1 ) , the system fails immediately at the first shock; in this case, the conditioning phase i is preserved at failure ( δ i j ). With complementary probability P ( X 0 p 1 ) , failure is delayed; in this case, the phase at failure is distributed as the renewal-stationary α , independent of the starting phase. The cleavage between “immediate” (phase-preserving) and “delayed” (phase-renormalizing) failure mechanisms is intrinsic to the model, and the two probabilities are naturally partitioned according to whether or not X 0 alone exceeds the threshold.
The full joint distribution of failure time and end phase has a similar clean structure.
Theorem 9 
(Phase-resolved failure-time distribution). For all i , j E and Re ( θ ) 0 ,
E e θ τ ν 1 { J ( τ ν ) = j } | J ( τ 0 ) = i = h 0 ( θ ) P ( X 0 > p 1 ) δ i j + h 0 ( θ ) v i ( θ ) α j G ( θ ) ,
where v ( θ ) = ( θ I S ) 1 s has ith component v i ( θ ) , and
G ( θ ) : = D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) h ( θ ) .
Proof. 
Set ξ = u = v = 1 , ϑ = 0 in (29): ω = θ , a 0 ( u v x ) = a 0 ( x ) , a ( u v x ) = a ( x ) , and the bracket simplifies to H ( θ ) / ( 1 a ( x ) h ( θ ) ) as in the proof of Theorem 3. The matrix H ( θ ) does not depend on x and pulls outside the D -operator:
Φ ν ( 1 , 1 , 1 , 0 , θ ) = h 0 ( θ ) P ( X 0 > p 1 ) I + h 0 ( θ ) H ( θ ) G ( θ ) .
The ( i , j ) entry of H ( θ ) = v ( θ ) α is v i ( θ ) α j , giving (51).    □
Remark 11 
(Rank-one structure of the delayed-failure contribution). The delayed-failure piece in (51) factors as v i ( θ ) α j G ( θ ) , a rank-one separation in the ( i , j ) pair. Conditional on delayed failure, the dependence of the failure-time distribution on the starting phase i is captured entirely by v i ( θ ) ; the dependence on the end phase j is captured entirely by α j ; and these two phase-dependences are coupled only through the scalar G ( θ ) . This decomposition is the matrix-analytic counterpart of the renewal-stationary phase-resampling at each post-delay shock, and exemplifies the structural simplicity that the phase-tagged framework reveals.
Remark 12 
(Marginal recoveries). At θ = 0 , both (50) (the phase distribution at failure) and the LST of (38) (the failure-time distribution) emerge as marginals of (51): j ( · ) recovers F ^ τ ν ( θ ) on the diagonal i-block, while θ 0 together with i α i ( · ) recovers (50). The phase-resolved formula (51) therefore strictly generalizes both Theorems 5 and 8, encoding the full bivariate distribution.

4.5. Summary of Reliability Indices

Table 1 consolidates the results of this section. Each closed-form expression is computable in finite arithmetic from the model primitives ( a 0 , a , h 0 , h , p 1 ) via the rational-function D -operator algorithm (Appendix B). No iterative matrix equation appears.

5. Numerical Example

We now illustrate the reliability indices of Section 4 on a concrete shock model and verify them against a Monte Carlo simulation. The example is deliberately chosen so that all model primitives, the inter-shock LSTs and the damage PGFs, are rational functions, so that the D -operator reduces to a finite Taylor-coefficient extraction (Appendix B) and every closed-form expression in Table 1 is computable in elementary arithmetic.

5.1. Model Specification

We instantiate the model of Section 2.1 as follows.
  • Inter-shock times.
    • The post-delay inter-shock times T n ( n 1 ) are i.i.d. two-phase Erlang with rate μ = 1 / 2 per phase: T n = E 1 + E 2 where E 1 , E 2 are i.i.d. Exp ( μ ) . In phase-type notation,
      α = ( 1 , 0 ) , S = μ μ 0 μ , h ( θ ) = μ μ + θ 2 , μ T = E [ T 1 ] = 2 / μ = 4 .
      The delay T 0 is exponential with rate μ 0 = 1 :
      h 0 ( θ ) = μ 0 μ 0 + θ , μ T 0 = E [ T 0 ] = 1 / μ 0 = 1 .
  • Damage sizes.
    • The post-initial damages X n ( n 1 ) are i.i.d. shifted geometric on { 1 , 2 , } with parameter p = 0.4 :
      P ( X n = k ) = p ( 1 p ) k 1 for k 1 , a ( u ) = p u 1 ( 1 p ) u , μ A = E [ X n ] = 1 / p = 2.5 .
      The initial damage X 0 is shifted geometric with parameter p 0 = 0.3 :
      a 0 ( u ) = p 0 u 1 ( 1 p 0 ) u , E [ X 0 ] = 1 / p 0 3.333 .
  • Threshold.
    • We fix the failure threshold at M = 10 , so p 1 = M 1 = 9 .
The choice p 0 p is deliberate: it exercises the full a 0 a structure of the model and prevents the formulas from collapsing to the i.i.d. case E [ X 0 ] = μ A .

5.2. Closed-Form Computation of Reliability Indices

For this model, all D -operator expressions involve rational functions of x, and the partial Taylor sum to order p 1 = 9 is computed via a constant-time recurrence (Appendix B). Table 2 reports the resulting closed-form values for the principal reliability indices.
The Wald identities can be verified directly from the table: MTTF = 1 + 4 × 3.280118 = 14.120472 and E [ S ν ] = 3 . 3 ¯ + 2.5 × 3.280118 = 11.533628 , both matching their respective entries to numerical precision. The internal consistency relation MTTF = E [ τ ν 1 ] + E [ τ ν τ ν 1 ] = 10.241532 + 3.878939 = 14.120471 is also satisfied.

5.3. Monte Carlo Verification

To verify the closed-form expressions, we ran a Monte Carlo simulation of N = 2 × 10 5  independent trajectories. The simulation generates each trajectory by sampling X 0 , T 0 , then iteratively sampling ( T n , X n ) until the cumulative damage exceeds the threshold; at each step, the relevant reliability quantities are recorded. Table 3 compares the empirical means against the theoretical values, together with the 95% Monte Carlo standard error.
For all eight indices, the absolute error between theoretical and simulated values is smaller than the 95% Monte Carlo standard error. This is the expected level of agreement for an unbiased estimator: the closed-form formulas are correct.

5.4. The Reliability Function

We compute the reliability function R ( t ) = P ( τ ν > t ) by numerical inversion of R ^ ( θ ) = ( 1 F ^ τ ν ( θ ) ) / θ via the Gaver–Stehfest algorithm (cf. [19,20]) with N = 14 summation terms. Figure 1 (left) shows the resulting R ( t ) together with the empirical reliability function from the Monte Carlo simulation.
The two curves are visually indistinguishable across the full time range 0 < t < 50 . Table 4 reports a pointwise comparison.
The errors at all sampled times are at the level of Monte Carlo noise. The slight negative value at t = 50 is a known artifact of the Gaver–Stehfest method when the inverted function approaches zero; it does not reflect an error in the closed-form R ^ ( θ ) but the limited numerical precision of the inversion at large arguments. For applications requiring high accuracy in the far tail, alternative algorithms such as the Talbot or de Hoog method may be substituted; the closed-form R ^ ( θ ) remains valid.

5.5. Phase-Resolved Failure Analysis

We illustrate the phase-resolved formulas of Section 4.4. By Theorem 8, the phase distribution at failure starting from phase i { 1 , 2 } is
P ( J ( τ ν ) = j J ( τ 0 ) = i ) = P ( X 0 > p 1 ) δ i j + P ( X 0 p 1 ) α j .
Numerically, with P ( X 0 > p 1 ) = 0.04035 , P ( X 0 p 1 ) = 0.95965 , and α = ( 1 , 0 ) :
P ( J ( τ ν ) = j J ( τ 0 ) = i ) i j = 0.04035 · 1 + 0.95965 · 1 0.04035 · 0 + 0.95965 · 0 0.04035 · 0 + 0.95965 · 1 0.04035 · 1 + 0.95965 · 0 = 1 0 0.95965 0.04035 .
The first row reflects the deterministic case α = ( 1 , 0 ) : every shock initiates in phase 1. The second row reveals the phase-resolution structure: starting in phase 2, the system fails in phase 2 with probability 0.04035 (the probability of immediate failure, in which the initial phase is preserved), and in phase 1 with probability 0.95965 (the probability of delayed failure, in which the post-delay shock-renewal mechanism resamples the phase from α ).
For the phase-resolved failure-time distribution (51), the LST decomposes additively as
E [ e θ τ ν 1 { J ( τ ν ) = j } J ( τ 0 ) = i ] = h 0 ( θ ) P ( X 0 > p 1 ) δ i j i m m e d i a t e - f a i l u r e piece + h 0 ( θ ) v i ( θ ) α j G ( θ ) d e l a y e d - f a i l u r e piece .
At θ = 0 the right-hand side reduces to the entrywise phase distribution computed above (since h 0 ( 0 ) = 1 , v i ( 0 ) = 1 , G ( 0 ) = P ( X 0 p 1 ) ). For θ > 0 , the formula provides the joint Laplace-domain characterization of (failure time, end phase). For example, at θ = 0.1 , starting from phase  i = 1 , conditional on ending in phase  j = 1 :
E [ e 0.1 τ ν 1 { J ( τ ν ) = 1 } J ( τ 0 ) = 1 ] = h 0 ( 0.1 ) · 0.04035 + h 0 ( 0.1 ) v 1 ( 0.1 ) α 1 G ( 0.1 ) 0.323 ,
which matches the unconditional F ^ τ ν ( 0.1 ) in this α = ( 1 , 0 ) instance, since all simulation mass is concentrated on the i = j = 1 entry.
The phase-resolved decomposition is most informative when α has full support: in such cases, the immediate-failure piece is concentrated on the diagonal ( i = j ) while the delayed-failure piece distributes mass according to the rank-one v i ( θ ) α j pattern, providing a complete operational picture of how failures are distributed across operational regimes.

5.6. Discussion

The numerical example demonstrates three points relevant to the contributions of the paper.
First, computational tractability. All twelve reliability indices in Table 1 were computed in elementary arithmetic without any iterative matrix solver. The most expensive operation is the Gaver–Stehfest inversion at each plotted time point, which requires O ( N p 1 ) operations per evaluation; closed-form values such as MTTF and E [ ν ] are essentially instantaneous to evaluate. The D -operator algorithm of Appendix B extends to any rational PGFs a 0 ,   a and rational LSTs h 0 ,   h ; these cover all phase-type, shifted-geometric, negative-binomial, and discrete phase-type combinations that appear in the cumulative shock literature.
Second, closed-form versus simulation. The agreement between closed-form values and Monte Carlo is at the level of Monte Carlo noise across all reliability indices and across the full reliability function R ( t ) . While Monte Carlo would always be available as a fallback, the closed-form formulas provide O ( 10 7 ) -fold speed gains over N = 2 × 10 5 simulation, with no statistical error and full availability of derivatives (sensitivities) by direct differentiation.
Third, phase-resolved insight. The closed form for P ( J ( τ ν ) = j J ( τ 0 ) = i ) in this two-phase example reveals the immediate/delayed failure cleavage transparently. In more general PH structures with a non-degenerate initial vector α , the same decomposition gives a complete operational breakdown of failure events by ending phase, a quantity that is—to our knowledge—not directly available in the standard matrix-analytic reliability literature [9,10,12], where the analysis of repairable systems via QBD methods focuses on steady-state availability and the rate of occurrence of failures rather than on first-passage joint distributions.

6. Discussion and Extensions

This section situates the contributions of the paper in the broader reliability and applied-probability literature, addresses two natural extensions of the framework, and outlines directions for follow-up work.

6.1. Position in the Literature

The reliability community has developed two largely separate analytic traditions for systems subject to random shocks.

6.1.1. Fluctuation-Theoretic Tradition

The first tradition treats the failure event as a first-passage event of a marked point process. Foundational work of [1,4] established the cumulative shock model as a tractable analytical framework. The first-passage functional approach was substantially developed by [5,6], with explicit transforms for the joint distribution of failure time, overshoot, and pre-failure quantities. Refs. [3,7] extended the framework to mixed soft- and hard-shock systems with linear degradation, and Ref. [8] treated dependent competing failure processes in this language. Ref. [17] and the broader shock-model literature surveyed in [2] provide complementary results within this tradition. Recent extensions of cumulative shock theory include protection mechanisms with practical applications to wind-turbine reliability [21], distributional analyses of discrete censored δ -shock variants [22], and dependent shock magnitudes [23]. The strength of the fluctuation-theoretic approach is the closed-form availability of the joint distribution of failure-time observables; its limitation, until now, has been an inability to incorporate the matrix structure that phase-type or Markov-modulated inter-shock dynamics naturally produce.

6.1.2. Matrix-Analytic Tradition

The second tradition originates in the work of [9] and is comprehensively presented in [10]. Phase-type, Markov-modulated, and quasi-birth-death (QBD) representations have been applied to a wide range of reliability problems: k-out-of-n:G systems, redundant systems with switching, repairable systems with vacations, and multi-component networks. The recent series of [11,12] exemplifies the contemporary state of the art, treating k-out-of-n:G repairable systems with K-mixed redundancy and repairman vacations under PH lifetime, repair, and vacation distributions. Related contributions in the same period [13,14,15] develop matrix-distributed and MAP-driven shock models that share our discrete phase-type machinery while pursuing distinct analytical objectives. The strength of the matrix-analytic approach is its ability to handle complex multi-component repair structures with phase information; its limitation has been a focus on stationary indicators (availability, ROCOF) rather than first-passage joint distributions.

6.1.3. The Phase-Tagged Framework as a Bridge

The phase-tagged first excess theory of [16] occupies the intersection of these traditions: it inherits the closed-form fluctuation analysis of the Dshalalow lineage while introducing the matrix-valued phase-tagging of the Neuts lineage. The present paper applies this bridge to cumulative shock reliability, producing the first closed-form results for the joint distribution of (failure time, overshoot, pre-failure quantities, end phase) under PH inter-shock times. Table 5 summarizes the position.

6.2. Extension to Position-Dependent Marking

Assumption 1 requires the damage sequence { X n } to be independent of the inter-shock time sequence { T n } . This is the analogue of the independent-marks assumption in marked-point-process language. Refs. [3,5] treat the more general setting of position-dependent marking, in which X n may depend on T n via a joint transform γ ( z , η ) = E [ z X n e η T n ] that does not factor as a ( z ) h ( η ) .
In the matrix-tagged framework, position-dependent marking corresponds to replacing the scalar PGF a and the matrix LST H ( θ ) by a single matrix-valued joint transform
Γ ( z , η ) i j = E z X n e η T n 1 { J ( τ n ) = j } | J ( τ n 1 ) = i ,
which captures the joint distribution of damage, inter-shock time, and the phase transition in a single object. The derivation of Theorem 1 carries through up to the matrix geometric series (26), but the Sherman–Morrison reduction (27) and the mixed-LST identity (5) no longer apply in their present form: Γ ( z , η ) is not generally rank-one in z, and the rank-one structure of H ( θ ) = v ( θ ) α is what produces the closed-form three-dimensional span of Theorem 2.
Therefore, the position-dependent case admits a structural representation
Φ ν pd ( ξ , u , v , ϑ , θ ) = ( i m m e d i a t e - e x c e s s ) + D x p 1 ξ a 0 ( u v x ) ( ) I ξ Γ ( u v x , ϑ + θ ) 1 Γ ( v , θ ) ,
in which the inverse ( I ξ Γ ( u v x , ω ) ) 1 is a general m × m matrix inverse rather than a rank-one Sherman–Morrison reduction. Such an inverse is computable but does not in general admit a low-dimensional span representation, and the elegant Wald-type identities of Theorems 6 and 7 do not survive without modification.
A natural special case in which the position-dependent framework retains tractability is when the dependence between X n and T n is mediated solely by the phase J ( τ n ) : that is, conditional on J ( τ n ) = k , the damage X n has phase-dependent PGF a k ( z ) but is otherwise independent of T n . In this case, Γ ( z , η ) retains a rank-one factorization when restricted to each terminal phase, and a phase-stratified version of the closed form can be obtained. This direction extends the framework toward the BMAP-style structure used in subsequent papers by the authors of [16] and is left for follow-up work.

6.3. Extension to Repairable and Multi-Component Systems

The cumulative shock model treated in this paper describes a non-repairable single-component system: the cumulative damage process is monotone non-decreasing, and the failure event is absorbing. The most natural extension is to repairable systems, in which the cumulative damage may be reset (or partially reset) at intervention epochs.
In the matrix-analytic reliability literature, repairable systems are typically analyzed via QBD methods that yield stationary availability and ROCOF; the framework of [12] for k-out-of-n:G systems with repairman vacations is a representative example. Bringing the phase-tagged framework to bear on repairable systems requires extending the threshold-crossing event structure: rather than the first passage of a monotone process, one studies the first passage of an embedded regenerative process. This corresponds in queueing terms to passing from cumulative-shock first-excess to busy-period or sojourn-time analysis. The phase-tagged formalism extends naturally; the matrix-valued first-passage functionals admit similar closed-form representations under PH inter-event distributions, but a complete development is beyond the scope of the present paper.
A second natural extension is to multi-component systems, including k-out-of-n:G structures. The single-threshold first-excess event { S ν > p 1 } generalizes to a multi-dimensional crossing event of the type studied by [24] for vector renewal processes. The matrix-tagged generalization of these multi-dimensional first-excess functionals would directly produce closed-form reliability indices for k-out-of-n:G systems with phase-type component lifetimes and repair-time distributions, providing a fluctuation-theoretic counterpart to the QBD analyses of [11,12]. A third direction concerns dependent failure processes in which degradation and shock arrivals interact, as studied recently by [25] for systems with self-healing and [26] for continuous fatigue degradation coupled to shock arrivals via a Markov renewal process. Extending the phase-tagged functional to track both the cumulative shock process and a coupled degradation process simultaneously is a natural avenue for future work in this direction.

6.4. Methodological Observations

We close with two methodological observations that may be useful in subsequent applications of the framework.

6.4.1. Span Dimension as a Structural Invariant

Theorem 2 shows that Φ ν lies in a three-dimensional matrix subspace, generalizing the two-dimensional span of [16]. The dimension counts the distinct “time scales” tracked by the functional: Ψ ( ξ , θ , u ) tracks one (the failure time), while Φ ν ( ξ , u , v , ϑ , θ ) tracks two (failure time τ ν and pre-failure time τ ν 1 ). This pattern suggests that further enrichment of the functional, for example, joint distribution of τ ν , τ ν 1 , and a third intermediate epoch τ ν 2 , would produce a four-dimensional span span { I , H ( θ ) , H ( ω ) , H ( ω + ϑ ) } for some additional time variable ϑ . The span dimension is therefore a structural invariant indexing how many time variables the analyst chooses to track. Computational cost grows with this dimension only through the addition of independent scalar coefficients; the underlying algebra remains tractable.

6.4.2. Reliability Indices and Wald-Type Identities

The two structural identities, Theorem 6 for MTTF = μ T 0 + μ T E [ ν ] and Theorem 7 for E [ S ν ] = E [ X 0 ] + μ A E [ ν ] , are not artifacts of our particular model: they reflect the underlying renewal-and-stopping structure of any cumulative-shock system with independent damage variables and inter-shock times. The extraction of these identities from Theorem 1 via the D -operator algebra illustrates a methodological point: closed-form first-passage transforms, when present, automatically yield Wald-type structural identities as corollaries of differentiation at the origin. Future applications of the phase-tagged framework to other reliability models should expect similar identities to emerge.

7. Conclusions

This paper has developed a closed-form analysis of the joint distribution for cumulative shock reliability systems with phase-type inter-shock times, resolving a methodological gap between the scalar fluctuation-theoretic and matrix-analytic traditions for shock-driven reliability. We summarize the contributions, the structural observations, and the directions for future work.

7.1. Principal Contributions

The paper makes four main contributions.
(1)
A matrix-valued reliability functional. We introduced Φ ν ( ξ , u , v , ϑ , θ ) , the joint transform of the failure index, pre-failure damage and time, failure-time damage and time, and the operational phase at the moment of failure, conditional on the initial phase. Theorem 1 provides the closed-form expression via Sherman–Morrison reduction of the matrix Laplace–Stieltjes transform together with the Dshalalow D -operator.
(2)
A bridge between two analytical traditions. The framework simultaneously generalizes the scalar fluctuation functional of [3,5] (Theorem 4) and extends the phase-tagged first excess functional of [16] to incorporate pre-failure quantities (Theorem 3). Both consistency relations are established by direct algebraic reduction from Theorem 1.
(3)
Twelve closed-form reliability indices. From Φ ν we extracted twelve indices in closed form: the failure-time LST, reliability function, mean time to failure, mean cumulative damage and overshoot, mean pre-failure damage and time, mean failure-causing inter-shock interval, mean failure-causing shock magnitude, joint LSTs and PGFs of pre-failure and failure pairs, and, new to the cumulative shock literature, the phase distribution at failure and the phase-resolved failure-time distribution.
(4)
Wald-type structural identities. Two identities emerged as corollaries: MTTF = μ T 0 + μ T E [ ν ] for total mean failure time, and E [ S ν ] = E [ X 0 ] + μ A E [ ν ] for total mean damage. Both express their target in terms of the fundamental scalar E [ ν ] , which admits an explicit D -operator representation.

7.2. Structural Observation

A notable feature of the closed form is the span structure of Theorem 2: the matrix functional Φ ν lies in the three-dimensional subspace span { I , H ( θ ) , H ( ω ) } , generalizing the two-dimensional span of [16]. The third basis element H ( ω ) encodes the joint pre-failure-time/failure-time tracking; in its absence ( ϑ = 0 ) the span collapses to two dimensions. We conjectured (Section 6.4) that further enrichment of the functional with intermediate epoch tracking would produce higher-dimensional spans of analogous form, with the dimension serving as a structural invariant counting the number of time scales monitored by the analyst.

7.3. Numerical Verification

A worked example with two-phase Erlang inter-shock times, exponential delay, and shifted-geometric damages (Section 5) verified all closed-form reliability indices against 2 × 10 5 Monte Carlo trajectories, with all errors below the 95% Monte Carlo standard error, and exhibited the reliability function R ( t ) obtained by Gaver–Stehfest inversion of the closed-form R ^ ( θ ) .

7.4. Future Work

Several extensions are natural and were sketched in Section 6.
  • Position-dependent marking and continuous damage. Position-dependent marking (in which damages depend on inter-shock times) breaks the rank-one structure of H ( θ ) , but tractable cases mediated by the phase variable connect to the BMAP-style extensions developed in subsequent work. The continuous-damage case, in which the PGF a ( u ) = E [ u X ] is replaced by the Laplace transform a ˜ ( η ) = E [ e η X ] , is a parallel direction.
  • Repairable and multi-component systems. The framework extends naturally to k-out-of-n:G structures via vector first-excess processes [24], providing a fluctuation-theoretic counterpart to the QBD analyses of [11,12].
  • Dependent shock-degradation processes. The framework also admits extension to settings where degradation and shock arrivals interact, as studied recently by [25,26].

7.5. Methodological Scope

Beyond reliability, the methodological pattern illustrated here (lifting a scalar fluctuation functional to matrix form, exploiting the rank-one structure of H ( θ ) to maintain Sherman–Morrison tractability, then extract observables via D -operator algebra) applies to any domain where first-passage joint distributions of cumulative processes are of interest. Inventory theory, insurance risk, dam and storage models, and Markov-modulated finance all fit this template. The phase-tagged framework provides a uniform analytical apparatus across these settings, with the present paper supplying a worked-out reliability instance and a template for further applications.

Funding

This research received no external funding.

Data Availability Statement

The data presented in this study consist of Monte Carlo simulation results generated using a Python implementation of the closed-form formulas described in Section 5. The code that generates the data is available from the corresponding author upon reasonable request.

Acknowledgments

The author gratefully acknowledges the foundational contributions of J. H. Dshalalow, whose first excess level theory and recent reliability program (in collaboration with R. T. White and others) constitute the direct intellectual foundation for the framework developed in this paper.

Conflicts of Interest

The author declares no conflicts of interest.

Appendix A. Detailed Proofs

Lemma A1 
(Algebraic equivalence used in Theorem 3). For all | ξ | 1 , | v | 1 , and Re ( θ ) 0 ,
D x p 1 ξ a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( v x ) h ( θ ) = ξ a ( v ) d 1 a 0 ( v ) 1 ξ a ( v ) h ( θ ) d 2 ( ξ , θ , v ) ,
where d 2 ( ξ , θ , v ) = D x p 1 ξ a 0 ( v x ) a ( v x ) / ( 1 ξ a ( v x ) h ( θ ) ) .
Proof. 
Decompose the numerator as a 0 ( v x ) [ a ( v ) a ( v x ) ] = a ( v ) a 0 ( v x ) a 0 ( v x ) a ( v x ) and split the D -operator by linearity:
D x p 1 ξ a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 ξ a ( v x ) h ( θ ) = ξ a ( v ) D x p 1 a 0 ( v x ) 1 ξ a ( v x ) h ( θ ) d 2 ( ξ , θ , v ) .
For the first D -image, write 1 / ( 1 ξ a ( v x ) h ( θ ) ) = 1 + ξ a ( v x ) h ( θ ) / ( 1 ξ a ( v x ) h ( θ ) ) , so that
a 0 ( v x ) 1 ξ a ( v x ) h ( θ ) = a 0 ( v x ) + h ( θ ) ξ a 0 ( v x ) a ( v x ) 1 ξ a ( v x ) h ( θ ) .
Applying D x p 1 and using D x p 1 { a 0 ( v x ) } = d 1 a 0 ( v ) :
D x p 1 a 0 ( v x ) 1 ξ a ( v x ) h ( θ ) = d 1 a 0 ( v ) + h ( θ ) d 2 ( ξ , θ , v ) .
Substituting this back and simplifying yields the claim.    □

Appendix B. Computing the D Operator for Rational PGFs

This appendix details the constant-time recurrence used throughout Section 4 and Section 5 to evaluate the D -operator on rational functions of x. Every closed-form expression in Table 1 reduces, after substitution of the model primitives, to a D -image of the form
D x p 1 N ( x ) D ( x )
where N and D are polynomials in x. The algorithm below extracts this value in O ( p 1 ) arithmetic operations.

Appendix B.1. The Taylor Recurrence

Recall from (7) that D x p 1 { f ( x ) } = j = 0 p 1 c j where f ( x ) = j 0 c j x j is the Taylor expansion of f at the origin. For rational f = N / D , the Taylor coefficients { c j } satisfy a linear recurrence determined by the coefficients of D.
Proposition A1 
(Rational-function Taylor recurrence). Let N ( x ) = j = 0 p 1 n j x j and D ( x ) = j = 0 L d j x j be polynomials with d 0 0 (extending N by zeros if it is of lower degree than p 1 ). The Taylor coefficients { c j } j 0 of f ( x ) = N ( x ) / D ( x ) satisfy
c j = 1 d 0 n j k = 1 min ( j , L ) d k c j k , j = 0 , 1 , , p 1 ,
with the convention n j = 0 for j exceeding the degree of N.
Proof. 
Writing f = N / D as D ( x ) f ( x ) = N ( x ) and expanding both sides as power series in x, the coefficient of x j on the left is k = 0 min ( j , L ) d k c j k , and on the right is n j . Solving for c j gives (A2).    □
The recurrence (A2) computes each Taylor coefficient c j in O ( L ) operations, where L is the degree of D. Computing D x p 1 { N / D } therefore requires O ( ( p 1 + 1 ) L ) operations, with no division except by the constant d 0 .

Appendix B.2. Worked Example

Consider the computation of E [ ν ] = D x p 1 { a 0 ( x ) / ( 1 a ( x ) ) } for the model of Section 5.1. With a ( u ) = p u / ( 1 q u ) where q = 1 p , we have
1 a ( x ) = 1 p x 1 q x = 1 q x p x 1 q x = 1 x 1 q x .
Therefore,
a 0 ( x ) 1 a ( x ) = p 0 x 1 q 0 x · 1 q x 1 x = p 0 x ( 1 q x ) ( 1 q 0 x ) ( 1 x ) .
Expanding,
N ( x ) = p 0 x p 0 q x 2 , D ( x ) = ( 1 q 0 x ) ( 1 x ) = 1 ( 1 + q 0 ) x + q 0 x 2 .
The polynomial coefficients are ( n 0 , n 1 , n 2 ) = ( 0 , p 0 , p 0 q ) and ( d 0 , d 1 , d 2 ) = ( 1 , ( 1 + q 0 ) , q 0 ) . Applying the recurrence:
c 0 = n 0 / d 0 = 0 , c 1 = n 1 d 1 c 0 = p 0 , c 2 = n 2 d 1 c 1 d 2 c 0 = p 0 q + ( 1 + q 0 ) p 0 ,
and so on. Summing the first ten coefficients ( p 1 = 9 ) yields E [ ν ] = 3.280118 , matching the value in Table 2.

Appendix B.3. Algorithmic Implementation

In numerical practice, the recurrence is implemented as a single loop:
  • function D_op(num_coeffs, den_coeffs, p_1):
        a = array of zeros, length p_1 + 1
        pad num_coeffs with zeros to length p_1 + 1
        for j = 0, 1, ..., p_1:
            s = num_coeffs[j]
            for k = 1, ..., min(j, length(den_coeffs) - 1):
                s = s - den_coeffs[k] * a[j - k]
            a[j] = s / den_coeffs[0]
        return sum(a[0..p_1])
For all model primitives a 0 , a , h 0 , h in the rational class, which encompasses shifted-geometric, negative-binomial, discrete phase-type, exponential, Erlang, hyper-exponential, and continuous phase-type distributions, this loop is the only computational primitive required. The reliability indices in Table 1 reduce to one or two such loops each, with the model primitives substituted into the rational expressions.

Appendix B.4. Comparison with Iterative Matrix-Analytic Methods

For comparison, the standard QBD-based computation of stationary availability or ROCOF for a system of comparable structure typically requires iterative solution of a matrix quadratic equation R 2 A 2 + R A 1 + A 0 = 0 via logarithmic reduction [10] or an equivalent iterative scheme. While these algorithms are themselves quite efficient, typically O ( log log ε 1 ) iterations for relative tolerance ε , they require linear-algebra subroutines and, more importantly, they target stationary indicators rather than first-passage joint distributions. The D -operator algorithm above achieves the latter directly, in a closed form that scales linearly with the threshold p 1 and requires no iterative refinement.

Appendix C. Detailed Moment Derivations

This appendix supplies algebraic details deferred from the proofs of Theorem 7 and Proposition 3 in Section 4.

Appendix C.1. Proof of the Wald-Type Identity for Cumulative Damage

We complete the differentiation of the scalar projection (37) in v at ξ = u = v = 1 , ϑ = θ = 0 . At these parameters, the projection reduces to
g ( v ) : = D x p 1 a 0 ( v x ) [ a ( v ) a ( v x ) ] 1 a ( v x ) ,
and we must compute g ( 1 ) . Let
A ( v ) : = a 0 ( v x ) , B ( v ) : = a ( v ) a ( v x ) , C ( v ) : = 1 a ( v x ) ,
treating x as a parameter. Then
A ( v ) = x a 0 ( v x ) , B ( v ) = a ( v ) x a ( v x ) , C ( v ) = x a ( v x ) .
By the quotient rule,
d d v A B C = ( A B + A B ) C A B C C 2 .
At v = 1 :
A ( 1 ) = a 0 ( x ) , A ( 1 ) = x a 0 ( x ) , B ( 1 ) = 1 a ( x ) , B ( 1 ) = μ A x a ( x ) , C ( 1 ) = 1 a ( x ) , C ( 1 ) = x a ( x ) ,
where μ A = a ( 1 ) . Substituting and grouping terms:
( A B + A B ) C A B C C 2 | v = 1 = x a 0 ( x ) [ 1 a ( x ) ] + a 0 ( x ) [ μ A x a ( x ) ] + x a 0 ( x ) a ( x ) 1 a ( x ) ,
where the term A B C / C 2 = a 0 ( x ) [ 1 a ( x ) ] · ( x a ( x ) ) / [ 1 a ( x ) ] 2 = x a 0 ( x ) a ( x ) / [ 1 a ( x ) ] has been pulled into the common denominator. The two x a 0 ( x ) a ( x ) terms (one from A B in the form x a 0 ( x ) a ( x ) , the other from the A B C / C 2 contribution as + x a 0 ( x ) a ( x ) ) cancel, yielding
v A B C | v = 1 = x a 0 ( x ) + μ A a 0 ( x ) 1 a ( x ) .
This cancellation is the key algebraic step in the proof of Theorem 7. Applying D x p 1 by linearity:
g ( 1 ) = D x p 1 { x a 0 ( x ) } + μ A D x p 1 a 0 ( x ) 1 a ( x ) .
The first term equals E [ X 0 1 { X 0 p 1 } ] since x a 0 ( x ) = k 1 k P ( X 0 = k ) x k has D -image 1 k p 1 k P ( X 0 = k ) = E [ X 0 1 { X 0 p 1 } ] . The second term is μ A E [ ν ] by (40). Hence
g ( 1 ) = E [ X 0 1 { X 0 p 1 } ] + μ A E [ ν ] .
Combining with the immediate-excess piece v [ a 0 ( v ) d 1 a 0 ( v ) ] | v = 1 = E [ X 0 ] E [ X 0 1 { X 0 p 1 } ] = E [ X 0 1 { X 0 > p 1 } ] :
E [ S ν ] = E [ X 0 1 { X 0 > p 1 } ] + E [ X 0 1 { X 0 p 1 } ] + μ A E [ ν ] = E [ X 0 ] + μ A E [ ν ] .
This completes the proof.

Appendix C.2. Proof of the Pre-Failure Damage Formula

We complete the differentiation of (37) in u at ξ = v = 1 , ϑ = θ = 0 . At these parameters, the projection reduces to
g ˜ ( u ) : = D x p 1 a 0 ( u x ) [ 1 a ( x ) ] 1 a ( u x ) .
Let A ( u ) = a 0 ( u x ) , C ( u ) = 1 a ( u x ) , with 1 a ( x ) a constant in u. Then
u A ( u ) ( 1 a ( x ) ) C ( u ) = ( 1 a ( x ) ) A ( u ) C ( u ) A ( u ) C ( u ) C ( u ) 2 .
Evaluating at u = 1 with A ( 1 ) = x a 0 ( x ) , C ( 1 ) = 1 a ( x ) , C ( 1 ) = x a ( x ) :
u a 0 ( u x ) ( 1 a ( x ) ) 1 a ( u x ) | u = 1 = x a 0 ( x ) [ 1 a ( x ) ] + x a 0 ( x ) a ( x ) 1 a ( x ) = x a 0 ( x ) + x a 0 ( x ) a ( x ) 1 a ( x ) .
Applying D x p 1 :
g ˜ ( 1 ) = D x p 1 { x a 0 ( x ) } + D x p 1 x a 0 ( x ) a ( x ) 1 a ( x ) = E [ X 0 1 { X 0 p 1 } ] + D x p 1 x a 0 ( x ) a ( x ) 1 a ( x ) .
Since the immediate-excess piece Φ ν ( 0 ) does not depend on u (corresponding to S 1 = 0 ), its u-derivative vanishes, and we obtain E [ S ν 1 ] = g ˜ ( 1 ) , which is (44).

References

  1. Esary, J.D.; Marshall, A.W.; Proschan, F. Shock models and wear processes. Ann. Probab. 1973, 1, 627–649. [Google Scholar] [CrossRef] [Scilit]
  2. Nakagawa, T. Shock and Damage Models in Reliability Theory; Springer: London, UK, 2007. [Google Scholar]
  3. Dshalalow, J.H.; White, R.T. Random walk analysis in a reliability system under constant degradation and random shocks. Axioms 2021, 10, 199. [Google Scholar] [CrossRef] [Scilit]
  4. Gut, A. Cumulative shock models. Adv. Appl. Probab. 1990, 22, 504–507. [Google Scholar] [CrossRef] [Scilit]
  5. Abolnikov, L.; Dshalalow, J.H. A first passage problem and its applications to the analysis of a class of stochastic models. J. Appl. Math. Stoch. Anal. 1992, 5, 83–98. [Google Scholar] [CrossRef] [Scilit]
  6. Dshalalow, J.H. Excess level processes in queueing. In Advances in Queueing: Theory, Methods, and Open Problems; Dshalalow, J.H., Ed.; CRC Press: Boca Raton, FL, USA, 1995; pp. 243–262. [Google Scholar]
  7. Dshalalow, J.H.; White, R.T. Fluctuation analysis of a soft-extreme shock reliability model. Mathematics 2022, 10, 3312. [Google Scholar] [CrossRef] [Scilit]
  8. Dshalalow, J.H.; Aljahani, H.; White, R.T. Dependent competing failure processes in reliability systems. Entropy 2024, 26, 444. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  9. Neuts, M.F. Structured Stochastic Matrices of M/G/1 Type and Their Applications; Marcel Dekker: New York, NY, USA, 1989. [Google Scholar]
  10. Latouche, G.; Ramaswami, V. Introduction to Matrix Analytic Methods in Stochastic Modeling; SIAM and ASA: Philadelphia, PA, USA, 1999. [Google Scholar]
  11. Wen, Y.; Liu, B.; Zhang, Z.; Shi, H.; Kang, S. Modeling and analysis for a repairable system with multi-state components under K-mixed redundancy strategy. Commun. Stat. Theory Methods 2024, 53, 748–764. [Google Scholar] [CrossRef] [Scilit]
  12. Wen, Y.; Liu, B.; Qiu, Q.; Shang, L.; Gao, Y. Matrix-analytic reliability modeling of k-out-of-n:G repairable systems with K-mixed redundancy and repairman’s multiple vacations. Reliab. Eng. Syst. Saf. 2026, 275, 112781. [Google Scholar] [CrossRef] [Scilit]
  13. Goyal, D.; Hazra, N.K.; Finkelstein, M. Shock models based on renewal processes with matrix Mittag-Leffler distributed inter-arrival times. J. Comput. Appl. Math. 2024, 435, 115090. [Google Scholar] [CrossRef] [Scilit]
  14. Goyal, D.; Ali, R.; Hazra, N.K. Reliability analysis of δ-shock models based on the Markovian arrival process. Appl. Stoch. Models Bus. Ind. 2024, 40, 1291–1312. [Google Scholar] [CrossRef] [Scilit]
  15. Hu, Z.; Hu, L. Reliability assessment of a multi-state mixed δ-shock model based on discrete phase-type distribution. Ann. Oper. Res. 2025, 353, 885–916. [Google Scholar] [CrossRef] [Scilit]
  16. Tadj, L. Phase-tagged first excess level theory: A matrix-analytic bridge to Dshalalow’s fluctuation functional. 2025; submitted.
  17. Eryilmaz, S. Discrete time shock models in a Markovian environment. IEEE Trans. Reliab. 2016, 65, 141–146. [Google Scholar] [CrossRef] [Scilit]
  18. Sherman, J.; Morrison, W.J. Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. Ann. Math. Stat. 1950, 21, 124–127. [Google Scholar] [CrossRef] [Scilit]
  19. Stehfest, H. Algorithm 368: Numerical inversion of Laplace transforms. Commun. ACM 1970, 13, 47–49. [Google Scholar] [CrossRef] [Scilit]
  20. Abate, J.; Whitt, W. Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. 1995, 7, 36–43. [Google Scholar] [CrossRef] [Scilit]
  21. Eryilmaz, S. A class of shock models for a system that is equipped with a protection block, with an application to wind turbine reliability. Appl. Stoch. Models Bus. Ind. 2025, 41, e70051. [Google Scholar] [CrossRef] [Scilit]
  22. Chadjiconstantinidis, S.; Eryilmaz, S. Distributions of random variables involved in discrete censored δ-shock models. Adv. Appl. Probab. 2023, 55, 1144–1170. [Google Scholar] [CrossRef] [Scilit]
  23. Eryilmaz, S. The evaluation of system reliability under dependent shock magnitudes. Methodol. Comput. Appl. Probab. 2026, 28, 22. [Google Scholar] [CrossRef] [Scilit]
  24. Dshalalow, J.H. First excess levels of vector processes. J. Appl. Math. Stoch. Anal. 1994, 7, 457–464. [Google Scholar] [CrossRef] [Scilit]
  25. Kang, F.; Cui, L.; Ye, Z.; Zhou, Y. Reliability analysis for systems with self-healing mechanism in degradation-shock dependence processes with changing degradation rate. Reliab. Eng. Syst. Saf. 2024, 241, 109627. [Google Scholar] [CrossRef] [Scilit]
  26. Jiang, S.; Jia, X. Reliability assessment under continuous fatigue degradation and shock based on Markov renewal process. Reliab. Eng. Syst. Saf. 2024, 248, 110151. [Google Scholar] [CrossRef] [Scilit]
Figure 1. (Left): theoretical reliability function R ( t ) obtained by closed-form computation of R ^ ( θ ) and Gaver–Stehfest inversion (solid blue), versus the empirical reliability function from N = 2 × 10 5 Monte Carlo trajectories (dashed red). The vertical dotted line marks MTTF = 14.12 . (Right): empirical distribution of the failure index ν from the Monte Carlo simulation, with the theoretical mean E [ ν ] = 3.280 marked.
Figure 1. (Left): theoretical reliability function R ( t ) obtained by closed-form computation of R ^ ( θ ) and Gaver–Stehfest inversion (solid blue), versus the empirical reliability function from N = 2 × 10 5 Monte Carlo trajectories (dashed red). The vertical dotted line marks MTTF = 14.12 . (Right): empirical distribution of the failure index ν from the Monte Carlo simulation, with the theoretical mean E [ ν ] = 3.280 marked.
Mathematics 14 01920 g001
Table 1. Reliability indices derived from the phase-tagged reliability functional Φ ν .
Table 1. Reliability indices derived from the phase-tagged reliability functional Φ ν .
QuantityClosed FormReference
F ^ τ ν ( θ ) h 0 ( θ ) P ( X 0 > p 1 ) + h 0 ( θ ) h ( θ ) D x p 1 a 0 ( x ) [ 1 a ( x ) ] 1 a ( x ) h ( θ ) Theorem 5
E [ ν ] D x p 1 a 0 ( x ) / ( 1 a ( x ) ) Theorem 6
MTTF μ T 0 + μ T E [ ν ] Theorem 6
E [ S ν ] E [ X 0 ] + μ A E [ ν ] Theorem 7
E [ S ν p 1 ] E [ X 0 ] p 1 + μ A E [ ν ] Corollary 2
E [ S ν 1 ] E [ X 0 1 { X 0 p 1 } ] + D x p 1 x a 0 ( x ) a ( x ) / ( 1 a ( x ) ) Proposition 3
E [ τ ν 1 ] μ T 0 P ( X 0 p 1 ) + μ T ( E [ ν ] P ( X 0 p 1 ) ) Proposition 4
E [ τ ν τ ν 1 ] μ T 0 P ( X 0 > p 1 ) + μ T P ( X 0 p 1 ) Corollary 3
E [ X ν ] E [ S ν ] E [ S ν 1 ] Corollary 4
P ( J ( τ ν ) = j J ( τ 0 ) = i ) P ( X 0 > p 1 ) δ i j + P ( X 0 p 1 ) α j Theorem 8
Phase-resolved E [ e θ τ ν 1 { J ( τ ν ) = j } J ( τ 0 ) = i ] Theorem 9
Joint LST E [ e ϑ τ ν 1 θ τ ν ] , joint PGF E [ u S ν 1 v S ν ] Proposition 5
Table 2. Closed-form values of the reliability indices for the model of Section 5.1, computed via the formulas of Table 1 and the rational D -operator algorithm of Appendix B.
Table 2. Closed-form values of the reliability indices for the model of Section 5.1, computed via the formulas of Table 1 and the rational D -operator algorithm of Appendix B.
QuantityValue
E [ ν ] 3.280118
MTTF = μ T 0 + μ T E [ ν ] 14.120471
E [ S ν ] = E [ X 0 ] + μ A E [ ν ] 11.533628
E [ S ν p 1 ] (mean overshoot) 2.533628
E [ S ν 1 ] 7.333590
E [ X ν ] (failure-causing shock magnitude) 4.200038
E [ τ ν 1 ] 10.241532
E [ τ ν τ ν 1 ] 3.878939
P ( X 0 p 1 ) 0.959646
P ( X 0 > p 1 ) 0.040354
Table 3. Theoretical (closed-form) versus simulated values of the reliability indices over N = 2 × 10 5 Monte Carlo trajectories.
Table 3. Theoretical (closed-form) versus simulated values of the reliability indices over N = 2 × 10 5 Monte Carlo trajectories.
QuantityTheoreticalSimulatedError95% MC SE
E [ ν ] 3.280118 3.282075 0.001957 0.006927
MTTF 14.120471 14.115045 0.005426 0.035917
E [ S ν ] 11.533628 11.540545 0.006917 0.008767
E [ S ν p 1 ] 2.533628 2.540545 0.006917 0.008767
E [ S ν 1 ] 7.333590 7.334450 0.000860 0.009706
E [ X ν ] 4.200038 4.206095 0.006057 0.013429
E [ τ ν 1 ] 10.241532 10.231517 0.010016 0.032954
E [ τ ν τ ν 1 ] 3.878939 3.883529 0.004589 0.012455
Table 4. Pointwise comparison of the theoretical reliability function R ( t ) (Gaver–Stehfest inversion of the closed-form R ^ ( θ ) ) versus the empirical R ( t ) from the Monte Carlo simulation.
Table 4. Pointwise comparison of the theoretical reliability function R ( t ) (Gaver–Stehfest inversion of the closed-form R ^ ( θ ) ) versus the empirical R ( t ) from the Monte Carlo simulation.
t R ( t ) Theoretical R ( t ) SimulatedAbsolute Error
1 0.972109 0.972100 0.000009
2 0.952221 0.952260 0.000039
5 0.872995 0.873645 0.000650
10 0.659651 0.659215 0.000436
14 0.462163 0.462430 0.000267
20 0.221970 0.220970 0.001000
30 0.042237 0.041445 0.000792
50 0.000587 0.000380 0.000967
Table 5. Position of the present framework relative to the two existing analytical traditions for shock-driven reliability systems.
Table 5. Position of the present framework relative to the two existing analytical traditions for shock-driven reliability systems.
Closed-FormPH Inter-ShocksPhase Tagging
First Passage at Failure
Cumulative shock fluctuation analysis
([3,5])
Matrix-analytic reliability (QBD-based)
([9,12])
Phase-tagged first excess ([16])
This paper (matrix lift with pre-failure)
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Tadj, L. Phase-Tagged Fluctuation Analysis of Cumulative Shock Reliability Systems with Phase-Type Inter-Shock Times. Mathematics 2026, 14, 1920. https://doi.org/10.3390/math14111920

AMA Style

Tadj L. Phase-Tagged Fluctuation Analysis of Cumulative Shock Reliability Systems with Phase-Type Inter-Shock Times. Mathematics. 2026; 14(11):1920. https://doi.org/10.3390/math14111920

Chicago/Turabian Style

Tadj, Lotfi. 2026. "Phase-Tagged Fluctuation Analysis of Cumulative Shock Reliability Systems with Phase-Type Inter-Shock Times" Mathematics 14, no. 11: 1920. https://doi.org/10.3390/math14111920

APA Style

Tadj, L. (2026). Phase-Tagged Fluctuation Analysis of Cumulative Shock Reliability Systems with Phase-Type Inter-Shock Times. Mathematics, 14(11), 1920. https://doi.org/10.3390/math14111920

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop