Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1, pp. 291–292 — on the re-entrant line with τ₂ + τ₄ > 1, the clearing policy is unstable, with or without set-up times

Proved
KumarSeidman.Reentrant.example1_clearing_unstable

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

instabilitymanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider the manufacturing system of Example 1: one part type arriving at rate 111 visits machine 1, machine 2, machine 2 and machine 1, through buffers 1,2,3,41, 2, 3, 41,2,3,4, with processing times τ1,…,τ4>0\tau_1, \dots, \tau_4 > 0τ1​,…,τ4​>0 satisfying the critical condition (3) and the capacity condition (1), i.e.

τ2+τ4>1,(3)\tau_2 + \tau_4 > 1, \tag{3}τ2​+τ4​>1,(3) τ1+τ4<1,(4)\tau_1 + \tau_4 < 1, \tag{4}τ1​+τ4​<1,(4) τ2+τ3<1.(5)\tau_2 + \tau_3 < 1. \tag{5}τ2​+τ3​<1.(5)

Start from x(0)=(ξ,0,0,0)x(0) = (\xi, 0, 0, 0)x(0)=(ξ,0,0,0) with machine 1 set up for buffer 4 and machine 2 set up for buffer 3, and schedule with a clearing policy.

  1. Case 1 (positive set-up times). If δ1,δ2,δ3,δ4>0\delta_1, \delta_2, \delta_3, \delta_4 > 0δ1​,δ2​,δ3​,δ4​>0, there is ξ0\xi_0ξ0​ such that for every ξ>0\xi > 0ξ>0 with ξ≥ξ0\xi \ge \xi_0ξ≥ξ0​, a clearing trajectory from this initial state exists, and along every such trajectory
sup⁡0≤t<∞x1(t)=+∞.\sup_{0 \le t < \infty} x_1(t) = +\infty.0≤t<∞sup​x1​(t)=+∞.
  1. Case 2 (no set-up times). If δ1=δ2=δ3=δ4=0\delta_1 = \delta_2 = \delta_3 = \delta_4 = 0δ1​=δ2​=δ3​=δ4​=0, then for every ξ>0\xi > 0ξ>0 a clearing trajectory from this initial state exists, and along every such trajectory sup⁡0≤t<∞x1(t)=+∞\sup_{0 \le t < \infty} x_1(t) = +\inftysup0≤t<∞​x1​(t)=+∞.

So the system is unstable under clearing even though every machine has spare capacity; in Case 2 the instability is caused purely by starvation of machines by upstream machines, not by set-up times.

Formalization Note The paper's conclusions are lim⁡n→∞x1(Tn)=+∞\lim_{n\to\infty} x_1(T_n) = +\inftylimn→∞​x1​(Tn​)=+∞ (Case 1) and lim⁡n→∞x1(t4n+1)=+∞\lim_{n\to\infty} x_1(t_{4n+1}) = +\inftylimn→∞​x1​(t4n+1​)=+∞ (Case 2); their common content, unboundedness of x1x_1x1​ on [0,∞)[0,\infty)[0,∞), is stated as: for every CCC there is t≥0t \ge 0t≥0 with x1(t)>Cx_1(t) > Cx1​(t)>C. The existence of a clearing trajectory is part of the statement, so the universal half is not vacuous. "Clearing" uses the reading of Definition 1 recorded with the clearing definition (a target buffer counts as nonempty when it is demanding). Time is real, and the model has no transport delays.

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_Reentrant_System
import Definitions.Def_KumarSeidman_Reentrant_Trajectory
import Definitions.Def_KumarSeidman_Reentrant_Clearing
import Definitions.Def_KumarSeidman_Reentrant_Example1
Formal statement
namespace KumarSeidman.Reentrant

/-- **Example 1** (Kumar–Seidman 1990, §III, pp. 291–292). Consider the re-entrant line of
Example 1 with processing times `τ₁, …, τ₄ > 0` (Lean `τ 0, …, τ 3`) satisfying the critical
condition (3) `τ₂ + τ₄ > 1` and the capacity condition (1), i.e. (4) `τ₁ + τ₄ < 1` and
(5) `τ₂ + τ₃ < 1`. Start from `x(0) = (ξ, 0, 0, 0)` with machine 1 set up for buffer 4 and
machine 2 set up for buffer 3.

* (Case 1, positive set-up times) If `δ₁, …, δ₄ > 0`, there is `ξ₀` such that for every
  `ξ > 0` with `ξ ≥ ξ₀` a clearing trajectory from that initial state exists, and along every
  such trajectory the level `x₁` of buffer 1 is unbounded on `[0, ∞)`.
* (Case 2, no set-up times) If `δ₁ = ⋯ = δ₄ = 0`, the same holds for every `ξ > 0`. -/
theorem example1_clearing_unstable (τ : Fin 4 → ℝ) (hτ : ∀ k, 0 < τ k)
    (h3 : 1 < τ 1 + τ 3) (h4 : τ 0 + τ 3 < 1) (h5 : τ 1 + τ 2 < 1) :
    (∀ (δ : Fin 4 → ℝ) (hδ : ∀ k, 0 < δ k),
      ∃ ξ₀ : ℝ, ∀ ξ : ℝ, 0 < ξ → ξ₀ ≤ ξ →
        (∃ T : Trajectory (ex1 τ hτ δ (fun k => (hδ k).le)),
          IsClearing (ex1 τ hτ δ (fun k => (hδ k).le)) T ∧ Ex1Initial T ξ) ∧
        ∀ T : Trajectory (ex1 τ hτ δ (fun k => (hδ k).le)),
          IsClearing (ex1 τ hτ δ (fun k => (hδ k).le)) T → Ex1Initial T ξ →
            ∀ C : ℝ, ∃ t : ℝ, 0 ≤ t ∧ C < T.x (ex1Buf 0) t) ∧
    (∀ ξ : ℝ, 0 < ξ →
      (∃ T : Trajectory (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)),
          IsClearing (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)) T ∧ Ex1Initial T ξ) ∧
        ∀ T : Trajectory (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)),
          IsClearing (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)) T → Ex1Initial T ξ →
            ∀ C : ℝ, ∃ t : ℝ, 0 ≤ t ∧ C < T.x (ex1Buf 0) t) := by sorry

end KumarSeidman.Reentrant
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, pp. 291–292, §III Example 1, Cases 1 and 2
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me