Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: the run-truncating FCFS supervisor keeps every buffer bounded under ρm<1\rho_m<1ρm​<1

Proved
KumarSeidman.Supervisor.supervisor_stabilizes

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

manufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingstabilitysupervisory-control

Consider any manufacturing system with set-up times that satisfies the capacity condition

ρm=∑(p,i): μp,i=mdpτp,i<1(1≤m≤M).\rho_m=\sum_{(p,i):\,\mu_{p,i}=m}d_p\tau_{p,i}<1\qquad(1\le m\le M).ρm​=(p,i):μp,i​=m∑​dp​τp,i​<1(1≤m≤M).

Choose supervisor parameters γm\gamma_mγm​ with γm(1−ρm)>∑b∈Bmmax⁡b′∈Bmδb′,b\gamma_m(1-\rho_m)>\sum_{b\in B_m}\max_{b'\in B_m}\delta_{b',b}γm​(1−ρm​)>∑b∈Bm​​maxb′∈Bm​​δb′,b​ (24) and thresholds zp,i≥0z_{p,i}\ge 0zp,i​≥0. Apply the supervisor (truncation of runs at γmdpτp,i\gamma_m d_p\tau_{p,i}γm​dp​τp,i​, an FCFS priority queue QmQ_mQm​ of buffers whose level exceeds zp,iz_{p,i}zp,i​, and processing of each queued buffer for exactly γmdpτp,i\gamma_m d_p\tau_{p,i}γm​dp​τp,i​ unless it clears) at every machine, on top of an arbitrary scheduling policy. Then every trajectory, from every initial state (initial levels, initial set-ups and initial queue order), has all buffer levels bounded over all time:

sup⁡0≤t<∞xp,i(t)<+∞for all p,i.\sup_{0\le t<\infty}x_{p,i}(t)<+\infty\qquad\text{for all }p,i .0≤t<∞sup​xp,i​(t)<+∞for all p,i.

The capacity condition is necessary for stability of any policy. The paper shows in §III that natural distributed policies (clearing policies) can be unstable even when it holds; this theorem shows that a simple distributed supervisor makes every policy stable whenever it holds.

Formalization Note The bound may depend on the trajectory. The base policy is constrained only by the run structure of the model (contiguous runs, no idling outside runs, full processing rate on a nonempty buffer) and by the supervisor's rules; it need not be a clearing policy.

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_Supervisor_System
import Definitions.Def_KumarSeidman_Supervisor_Trajectory
import Definitions.Def_KumarSeidman_Supervisor_Mechanism
Formal statement
namespace KumarSeidman.Supervisor

/-- Theorem 2 (Kumar–Seidman 1990, p. 297). Under the capacity condition (1), with run-length
parameters `γ` satisfying (24) and arbitrary thresholds `z ≥ 0`, every trajectory of an
arbitrary scheduling policy modified by the supervisor at all machines keeps every buffer level
bounded over `[0, ∞)`, from every initial state. -/
theorem supervisor_stabilizes {P M : ℕ} (S : System P M) (hcap : S.CapacityCondition)
    (γ : Fin M → ℝ) (hγ : GammaCondition S γ) (z : Buffer S → ℝ) (hz : ∀ b, 0 ≤ z b)
    (T : Trajectory S) (hT : T.Supervised γ z) :
    T.IsStable := by sorry

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