Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 2, Case 1, p. 293 — from x(0)=(0,η,0,η)x(0)=(0,\eta,0,\eta)x(0)=(0,η,0,η) the clearing trajectory returns to the same state at t=ηt=\etat=η

Proved
KumarSeidman.TwoType.case1_periodic

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

clearing-policymanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1periodic-orbitscheduling

Consider the system of Example 2 with positive processing times τ1,…,τ4\tau_1,\dots,\tau_4τ1​,…,τ4​ and positive set-up times δ1,…,δ4\delta_1,\dots,\delta_4δ1​,…,δ4​. Assume the capacity condition (1), τ1+τ4<1\tau_1+\tau_4<1τ1​+τ4​<1 and τ2+τ3<1\tau_2+\tau_3<1τ2​+τ3​<1, and conditions (8)–(10):

δ1+δ41−τ1−τ4=δ2+δ31−τ2−τ3=:η,δ4<(1−τ3−τ4)η,δ2<(1−τ1−τ2)η.\frac{\delta_1+\delta_4}{1-\tau_1-\tau_4}=\frac{\delta_2+\delta_3}{1-\tau_2-\tau_3}=:\eta,\qquad \delta_4<(1-\tau_3-\tau_4)\eta,\qquad \delta_2<(1-\tau_1-\tau_2)\eta .1−τ1​−τ4​δ1​+δ4​​=1−τ2​−τ3​δ2​+δ3​​=:η,δ4​<(1−τ3​−τ4​)η,δ2​<(1−τ1​−τ2​)η.

Consider a time t=0t=0t=0 at which buffers 1 and 3 have just been cleared: x(0)=(0,η,0,η)x(0)=(0,\eta,0,\eta)x(0)=(0,η,0,η), machine 1 is set up for buffer 1 and machine 2 for buffer 3. Then every clearing trajectory from this state satisfies

x(η)=(0,η,0,η),x(\eta)=(0,\eta,0,\eta),x(η)=(0,η,0,η),

and at time η\etaη machine 1 is again set up for buffer 1 and machine 2 for buffer 3.

The system therefore returns to its initial state at t=ηt=\etat=η, which gives a periodic regime in which all buffers stay bounded. Assumption (7) is not needed.

Formalization Note "Set up for bbb at time η\etaη" means that the run of the machine that contains η\etaη in its half-open interval (sk,sk+1](s_k,s_{k+1}](sk​,sk+1​] is devoted to bbb. At η\etaη both machines are about to commence a set-up, exactly as at t=0t=0t=0. η\etaη is computed from the data as (δ1+δ4)/(1−τ1−τ4)(\delta_1+\delta_4)/(1-\tau_1-\tau_4)(δ1​+δ4​)/(1−τ1​−τ4​); the denominators are positive by (1).

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_TwoType_Example2
Formal statement
namespace KumarSeidman.TwoType

open Example2

/-- Example 2, Case 1 (p. 293): under (8)–(10) and the capacity condition (1) (but not (7)),
starting at `t = 0` with `x(0) = (0, η, 0, η)` and machines 1, 2 set up for the just-cleared
buffers 1, 3, every clearing trajectory is back in the same state at `t = η`. -/
theorem case1_periodic (τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄ : ℝ)
    (hτ₁ : 0 < τ₁) (hτ₂ : 0 < τ₂) (hτ₃ : 0 < τ₃) (hτ₄ : 0 < τ₄)
    (hδ₁ : 0 < δ₁) (hδ₂ : 0 < δ₂) (hδ₃ : 0 < δ₃) (hδ₄ : 0 < δ₄)
    (h8 : (δ₁ + δ₄) / (1 - τ₁ - τ₄) = (δ₂ + δ₃) / (1 - τ₂ - τ₃))
    (h9 : δ₄ < (1 - τ₃ - τ₄) * ((δ₁ + δ₄) / (1 - τ₁ - τ₄)))
    (h10 : δ₂ < (1 - τ₁ - τ₂) * ((δ₁ + δ₄) / (1 - τ₁ - τ₄)))
    (h1₁ : τ₁ + τ₄ < 1) (h1₂ : τ₂ + τ₃ < 1)
    (T : (example2 τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄).Schedule) :
    let η := (δ₁ + δ₄) / (1 - τ₁ - τ₄)
    T.IsClearingFrom (levels 0 η 0 η) (setups b₁ b₃) →
      (∀ b, T.x b η = levels 0 η 0 η b) ∧ T.SetupFor m₁ η b₁ ∧ T.SetupFor m₂ η b₃ := by sorry

end KumarSeidman.TwoType
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 293, Example 2, Case 1
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