Repair cycles can have memory even when their averages match
Use alternating renewal reasoning, compare exponential and nonmemoryless durations, and distinguish replacement, minimal repair, and finite-time reliability questions.
On this page
The question for today
What you’ll understand
- Calculate long-run availability from regenerative up/down cycles.
- Explain why equal mean repair time does not imply equal recovery tails.
- Distinguish an as-good-as-new renewal from minimal repair and aging.
A repair can take a fixed twenty minutes, an exponential waiting time, or a mixture with rare multi-day interventions. Those processes can share the same mean while producing different incident experiences. Renewal models describe repeated cycles without requiring every duration to be memoryless. The useful step is to identify when the process genuinely starts over and what information from earlier cycles remains relevant.
A regenerative cycle gives a reward ratio
In an alternating renewal model, a cycle consists of an up period U followed by a down period D before a comparable new cycle begins. Assume independent identically distributed cycles, positive finite expected cycle length, and the regularity needed for the long-run limit. Counting up time as reward gives long-run availability E[U]/E[U+D]. This ratio of expectations is not generally the expectation of each cycle's up fraction. Long cycles occupy more observed time, so averaging short and long cycles with equal weight can answer a different question.
The model does not require U and D to be exponential. Dependence within a cycle can be allowed when the regenerative-cycle assumptions remain valid, but dependence across successive cycles or a changing environment needs a richer model. A successful repair that returns a service to a known reference state is a candidate renewal boundary. A repair that leaves accumulated wear, degraded redundancy, or a backlog of related incidents may not start an identical new cycle. State what is reset rather than assuming every incident closure makes the process as good as new.
Elapsed repair time can change the remaining wait
An exponential down duration has a memoryless remaining lifetime: waiting ten minutes does not change its conditional distribution of additional waiting. A deterministic repair duration has the opposite structure: after most of the required work has elapsed, little time remains. Weibull and lognormal families can represent other shapes, subject to evidence. A single mean cannot distinguish these conditional behaviors. If a runbook gives an expected remaining recovery time based on elapsed incident age, it is implicitly making a distributional claim that should be checked against completed and still-open incidents.
Failure-rate models for repairable systems also differ from nonrepairable lifetime models. An as-good-as-new replacement can support renewal lifetimes. Minimal repair may restore operation while leaving the age-dependent failure intensity largely unchanged. NIST distinguishes homogeneous and nonhomogeneous Poisson repair-rate models from lifetime distributions; a power-law process is not simply a sequence of iid Weibull lifetimes. Confusing these models can make an improving or deteriorating system appear stationary. Select the model for the actual maintenance effect and the observation timeline rather than matching a distribution name to a familiar curve.
Validate the cycle boundary and the user impact
Collect up and down durations with consistent start and end definitions, including observation gaps and open incidents. Distinguish detection, mitigation, full repair, and restoration of redundancy; they can be different endpoints. A service can resume user traffic before the system is ready to tolerate another fault. Model the endpoint relevant to the objective and avoid silently mixing phases into one MTTR field. Validate cycle independence across maintenance campaigns, software versions, and shared events. A stationary estimate can be useful for a chosen period while failing as a forecast after a major operational change.
The Markov lab is a memoryless discrete baseline, not a general renewal simulator. Reset, set BOTH p=0.2 and q=0.25, predict stationary down probability 0.2/0.45≈0.4444, then Play or Step. Reset and re-set BOTH p=0.2 and q=0.5 for a baseline of about 0.2857. n=floor(2t), and edits retain t/recompute from initial up state. The sliders specify per-step transitions, not deterministic or Weibull repair durations. Explain which elapsed-age information this two-state chain omits before using the cycle formula and repair evidence to choose a different model.
Work it through
The same mean down time can hide different remaining work
A fictional regenerative service has mean up time 90 minutes and mean down time ten minutes. Compare a deterministic ten-minute repair with an exponential repair of mean ten minutes after nine minutes have already elapsed without completion.
Both cycle models have the same long-run availability ratio 90/(90+10)=0.9 under the stated regenerative assumptions.
For deterministic ten-minute repair, surviving to elapsed nine minutes leaves exactly one minute until completion in this ideal model.
For exponential repair, memorylessness leaves an expected additional ten minutes despite nine already elapsed. Equal mean down time and availability do not imply equal conditional recovery experience.
Both long-run fractions are 90 percent, but their remaining-time predictions differ sharply. The repair distribution matters beyond its mean.
The living notebook
Explore the model
Interactive lab · markov
A memoryless baseline omits repair age
For EACH run Reset, set BOTH p and q, predict, then Play or Step. Compare (0.2,0.25), stationary down ≈0.4444, with (0.2,0.5), ≈0.2857. n=floor(2t); edits retain t/recompute from state 0. This exact discrete chain has geometric step holding times, not arbitrary renewal or physical repair-duration distributions.
- P(state 1) at step 0
- 0%
- Stationary P(state 1)
- 60%
- Chain behavior
- Monotone convergence
Exact finite-step probabilities for a two-state chain starting in state 0, not sampled trajectories. Playback advances two transitions per second. When p = q = 0 every distribution is stationary; when p = q = 1 the chain alternates forever. A single zero transition creates an absorbing state. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA two-state memoryless baseline cannot represent every repair-age effect, even when mean durations look similar.
Pause & reason
Check your understanding
Your turn
Try it yourself
Iid regenerative cycles have mean up time 180 minutes and mean down time 20 minutes. Calculate long-run availability. Does that value prove at most twenty down minutes in every 200-minute observation window?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The reward ratio is a long-run limit, not a bound on every realized finite window.
Compare with the solution
Availability is 180/(180+20)=0.9. It does not guarantee a maximum of twenty down minutes in each 200-minute window; individual cycles and the placement of a window can vary substantially. A finite-window bound requires a different model and evidence.
Keep the idea
Take it with you
- Regenerative up/down cycles can support a long-run availability ratio without exponential durations.
- Repair-age and tail behavior require more than one mean.
- Replacement, minimal repair, and changing environments imply different stochastic models.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.