Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, pp. 1409–1410 — after finite times T^(i), every i-busy period lasts at most Γ^(i)

Proved
ReentrantScheduling.FBFS.busy_period_bound

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

busy-periodfbfsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing-networkreentrant-line

Consider a nonacyclic flow line operated under first buffer first serve (FBFS), with releases satisfying the burstiness constraint (1) with constants λ,γ≥0\lambda,\gamma\ge0λ,γ≥0 and load ρ=λwˉ<1\rho=\lambda\bar w<1ρ=λwˉ<1 (3). Then there are finite times T(1),…,T(l)T^{(1)},\dots,T^{(l)}T(1),…,T(l) such that for every buffer index iii and every iii-busy period [T1,T2][T_1,T_2][T1​,T2​] with T1>T(i)T_1>T^{(i)}T1​>T(i),

T2−T1≤Γ(i),T_2-T_1\le\Gamma^{(i)},T2​−T1​≤Γ(i),

where Γ(i)\Gamma^{(i)}Γ(i) is defined recursively by Γˉ=∑j=1i−1(Γ(j)+τj)\bar\Gamma=\sum_{j=1}^{i-1}(\Gamma^{(j)}+\tau_j)Γˉ=∑j=1i−1​(Γ(j)+τj​) and

Γ(i)=[2τˉ+∑j: σj=σi, j≤iλτjΓˉ+γτjmσi][1−∑j: σj=σi, j≤iλτjmσi]−1.\Gamma^{(i)}=\Big[2\bar\tau+\sum_{j:\ \sigma_j=\sigma_i,\ j\le i}\frac{\lambda\tau_j\bar\Gamma+\gamma\tau_j}{m_{\sigma_i}}\Big]\Big[1-\sum_{j:\ \sigma_j=\sigma_i,\ j\le i}\frac{\lambda\tau_j}{m_{\sigma_i}}\Big]^{-1}.Γ(i)=[2τˉ+j: σj​=σi​, j≤i∑​mσi​​λτj​Γˉ+γτj​​][1−j: σj​=σi​, j≤i∑​mσi​​λτj​​]−1.

An iii-busy period is an interval at every instant of which some part waits in a buffer bjb_jbj​, j≤ij\le ij≤i, at the center σi\sigma_iσi​.

This is the induction hypothesis of the proof of Theorem 1, established for every iii; the constants depend only on the line and on λ,γ\lambda,\gammaλ,γ, while the times T(i)T^{(i)}T(i) depend on the run, in particular on the initial state.

Formalization Note Buffers are 0-based (i is the paper's i+1i+1i+1). The page prints Γ(i)\Gamma^{(i)}Γ(i) as a product of the two brackets; the Lean uses the quotient that the preceding inequality yields (see the Constants definition). The times T(i)T^{(i)}T(i) are existentially quantified after the run.

Preamble
import Mathlib
import Definitions.Def_ReentrantScheduling_FBFS_Model
import Definitions.Def_ReentrantScheduling_FBFS_Constants
Formal statement
namespace ReentrantScheduling.FBFS

theorem busy_period_bound
    (L : Line) (lam γ : ℝ) (hlam : 0 ≤ lam) (hγ : 0 ≤ γ) (hload : L.load lam < 1)
    (R : Run L) (hR : R.Admissible L.fbfs) (harr : R.Arrivals lam γ) :
    ∃ T : Fin L.l → ℝ, ∀ (i : Fin L.l) (T₁ T₂ : ℝ), T i < T₁ → T₁ ≤ T₂ →
      (∀ t : ℝ, T₁ ≤ t → t ≤ T₂ → R.Busy i t) →
      T₂ - T₁ ≤ L.Gamma lam γ i := by sorry

end ReentrantScheduling.FBFS
Source
Lu & Kumar, Distributed Scheduling Based on Due Dates and Buffer Priorities, IEEE TAC 36(12), 1991, p. 1409, proof of Theorem 1, the induction hypothesis; p. 1410, Γ^(i)
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