Contract Composition for Dynamical Control Systems: Definition and Verification using Linear Programming

The paper’s Theorem 4.2/5.2 equivalence and |V|+1 LP check are correct and rigorously proved (with extendibility and DAG/well-posedness assumptions) and match the optimization formulations (10)/(12) and Appendix A proofs. The model’s sufficiency argument incorrectly infers component guarantees γ_i from assumptions α_i using the contract Ci alone, conflating contract sets with system satisfaction; the paper instead relies on Definition 4.1 and uses existence of Ω_i only where appropriate (Appendix A). See the theorem statements and LP reduction for feedback-less networks and general networks, and the proofs in Appendix A for the precise logic flow .