{"id":"4720a98a-c10a-40b8-9392-3cf9abb0e2d8","arxiv_id":"2501.09324","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"Sufficient conditions and K-step exit-probability bounds are given for stochastic discrete-time control systems using affine and quadratic control barrier functions, including unbounded safe sets.","lead":"This paper derives new conditions for safe controller synthesis in discrete-time stochastic control systems, using control barrier functions with flexible auxiliary functions to bound the probability of leaving a safe set. It extends prior martingale-based safety certificates to unbounded safe regions, with numerical examples for affine and quadratic barrier functions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 6 is conditionally valid, but the numerical examples assert global feasibility of the CBF condition without proof; a single reachable state with no feasible control can invalidate the safety bound.","rationale":"The reader's weakest assumption—that the CBF existence condition is verified only at selected points and then asserted globally—is exactly the load-bearing gap I identify. The central theorem itself appears mathematically sound: the supermartingale argument in Theorem 6 is a standard stopped-process Ville inequality, and the Gaussian-integral computation in Theorem 11 checks out apart from the sign error in Eq. (40). However, the paper's numerical demonstrations do not establish that the premise of the theorem holds for all states reachable under the proposed safety filter. Section 5.2 explicitly claims feasibility at the origin 'and consequently for all x in C' without proof; for a nonlinear inverted pendulum this is not a valid inference, and for the non-convex obstacle-avoidance example in Section 5.3, local optimization cannot certify existence. If the premise fails at even one reachable state, the exit-probability bound is vacuous for the closed-loop system. This concern is concrete and testable by a grid-based feasibility check. I also note a typo in the proof of Theorem 6: A1 is defined with 'for 0≤k≤K', which would make the event empty; the intended existential quantifier is evident from the surrounding argument and should be fixed. Neither issue requires rejecting the paper—both are addressable by corrections and additional verification—so the reader's CONDITIONAL verdict stands unchanged.","tokens_in":12521,"tokens_out":16092,"duration_ms":144099,"concrete_test":"For each numerical example (Sections 5.1–5.3), generate a dense grid (e.g., 10^4 points) in the safe set C, and for each grid point x and each k in {0,...,K-1}, solve the feasibility problem: does there exist u in R^m such that (13) holds, with the paper's chosen parameters? For Theorem 11, check (29) directly; for the affine example, use the corrected inequality with -log(exp(-ax)+beta) rather than +log as in (40). If any reachable grid point is infeasible, the global-feasibility assumption is false and the reported probability bounds are not guaranteed. A smaller targeted version: for the inverted pendulum, sample states along the boundary h(x)=0 and verify (47) at those states.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 6 gives a conditional result: the exit-probability bound (14) holds only if, for every x in the safe set C and every k<K, there exists u satisfying the supermartingale inequality (13). The paper never demonstrates this for its examples. In Section 5.2, the authors state that a particular (a,beta) 'ensure the feasibility of (47) for the case x=0 and F(x,u)=0, and consequently for all x in C'. This inference is unjustified: the inverted-pendulum dynamics are nonlinear, and even if (47) is feasible at the origin, feasibility can fail away from the origin, especially near the boundary h(x)=0 where the term -log(exp(-ah(x))+beta) becomes large as h(x)->0. A failure at any reachable state means the safety filter (23) has no solution, the stopped process Phi(h(x_{k∧tau}),k∧tau) is not a supermartingale, and the bound (14)/(33) does not apply to the closed-loop system. The same unverified global-feasibility assumption is made in the obstacle-avoidance examples (Section 5.3), where the optimization is non-convex and solving it locally does not guarantee existence. Thus the paper's main applied claim—that the proposed filters achieve the stated K-step exit-probability bounds—is not established. The proof of Theorem 6 also contains a quantifier typo: A1 is written with 'for 0≤k≤K', which would make it empty; the intended meaning is clearly 'there exists k', but this should be corrected.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies discrete-time stochastic systems with additive Gaussian noise and proposes a CBF-based safety-filter synthesis with finite-horizon exit-probability bounds. The main result, Theorem 6, states that if an auxiliary function Φ is decreasing in the barrier h and satisfies the supermartingale condition (13) for every x in the safe set and k<K, then the K-step exit probability is bounded by Φ(h(x0),0)/min_{0≤k≤K}Φ(0,k). The proof uses Ville's inequality on the stopped process. The paper then specializes Φ to polynomial functions for bounded h (Proposition 8) and to exponential functions for unbounded quadratic h (Theorem 11), with closed-form Gaussian expectations. Numerical examples cover affine, inverted-pendulum, and obstacle-avoidance problems. The central theoretical result is conditional on the existence of a feasible control at every reachable state, and the numerical sections attempt to verify this by design choices and simulations.","tokens_in":12861,"tokens_out":7870,"duration_ms":76234,"significance":"If the existence conditions are met, Theorem 6 is a clean unification of supermartingale-based safety certificates and can yield tighter bounds than the linear bounds of Theorem 4; the extension to unbounded quadratic barriers in Theorem 11 is a useful contribution beyond prior bounded-barrier results. The manuscript gives explicit closed-form Gaussian integral computations and clearly identifies the structural restriction Λ>0. The main weakness is that the numerical sections assert global feasibility of the CBF constraint on the basis of local checks, and two displayed equations in the examples contain algebraic errors; these need to be fixed before the applied claims are fully supported.","major_comments":[{"comment":"The statement that the chosen parameters a=10 and β=10^{-5} 'ensure the feasibility of (47) for the case x=0 and F(x,u)=0, and consequently for all x∈C' is not justified. Feasibility at a single point does not imply feasibility at every point of the safe set; the right-hand side of (47) varies with h(x) and the left-hand side depends on F(x,u) through the nonlinear pendulum dynamics. Since Corollary 7 requires the constraint (13) to have a solution at every reachable state before the stopping time, the safety bound (48) is not established for the closed-loop system unless global feasibility is proven or verified systematically (e.g., by SOS or a rigorous global-optimization argument). The same concern applies to the non-convex obstacle-avoidance example in §5.3, where local solutions of (23) do not constitute a global existence certificate.","section":"§5.2, Eq. (47)"},{"comment":"Eq. (40) contains a sign error. From (36) with h replaced by ah, the correct condition is a(x+uΔt) ≥ -log(exp(-ax)+β) + (a²/2)σ²Δt. The printed expression uses log(exp(-ax)+β) without the minus sign, which is inconsistent with Theorem 11 and changes the feasible set. Additionally, in Eq. (47) the term involving (1/2Σ^{-1}+aA) appears to be missing the inverse required by (30); as written it is not the Θ term of Theorem 11. Both displayed equations should be corrected and the simulations re-verified.","section":"§5.1, Eq. (40); §5.2, Eq. (47)"},{"comment":"The set A1 is defined with 'for 0≤k≤K', which would require the inequality to hold at every time. The exit event {min_{0≤k≤K} h(x_k)<0} only implies the existence of at least one k with Φ(h(x_k),k)>Φ(0,k). The equality in (15) is therefore false as written. Replace 'for' with 'for some' or an existential quantifier, and adjust the A1⊂A2 argument accordingly.","section":"Theorem 6, Eq. (16)"}],"minor_comments":[{"comment":"The captions state 'using Theorem 6', but the examples actually apply the quadratic CBF condition of Theorem 11; the captions should be updated to reflect the theorem used.","section":"§5.3, Fig. 3 and Fig. 4 captions"},{"comment":"The word 'hyperbora' should be 'hyperbola'.","section":"§5.3"},{"comment":"The paper would benefit from a statement on whether simulation code or scripts are available for reproducibility.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The central theoretical framework is sound and the paper makes a useful contribution. The main gap is that the numerical examples assert global feasibility of the CBF constraint without proof, and the displayed equations contain algebraic errors that affect reproducibility. These issues are fixable within the scope of a revision, so I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core theoretical result here is solid and worth engaging with. Theorem 6 is a clean restatement of Ville's inequality as a safety certificate: if you can find any auxiliary function Phi that makes E[Phi(h(x_{k+1}),k+1)|F_k] <= Phi(h(x_k),k), then the K-step exit probability is bounded by Phi(h(x0),0)/min_k Phi(0,k). That is not new in itself, but it unifies the linear bounds of Theorem 4 and provides the right framework for what is new: the exponential construction Phi = exp(-h) + (K-k)beta in Theorem 11, which works for unbounded affine and quadratic h under Gaussian noise. The Gaussian integral computation is correct as far as I checked, and the structural condition Lambda = 0.5 Sigma^{-1} + A > 0 is stated honestly. Proposition 8 for polynomial bounded CBFs is also a reasonable extension of Santoyo et al., and Remark 13 rightly concedes that the bounded quadratic case reduces to Steinhardt and Tedrake. The paper gives credit where prior work is due.\n\nThe soft spots are real but not fatal to the theory. The main issue is that the numerical examples assert global feasibility of the CBF condition without proof. Section 5.2 says a choice of (a,beta) that works at x=0 works 'consequently for all x in C' — that inference is unjustified for a nonlinear inverted-pendulum model. The same gap appears in the obstacle-avoidance example, where the optimization is non-convex. If at any reachable state no u satisfies the supermartingale inequality, the safety filter has no solution and the stated exit-probability bound does not apply to the closed loop. This is a standard issue in CBF papers, but here it undermines the applied claim that the filters achieve the computed bounds. Second, there is a sign error in Eq (40): the log term should be -log(exp(-ax)+beta), not +log(...). The simulations may have used the correct form, but as written the condition is wrong. Third, the proof of Theorem 6 has a quantifier typo in A1: 'for 0<=k<=K' should be 'there exists k'. Minor, but should be fixed.\n\nWho is this for? People working on stochastic safety filters and discrete-time CBFs will find Theorem 11 useful and the comparison of bounds instructive. The paper deserves a serious referee: the mathematical framework is significant enough, and the probabilistic bound is a genuine tool. I would send it to peer review with a request for major revision on the feasibility question and the sign typo. The central argument holds up; the examples need to either prove feasibility on a verified subset of C or soften the claims to match what is actually demonstrated.","headline":"A sound Ville-based safety framework with a genuinely new exponential-Phi construction for unbounded affine and quadratic CBFs, but the numerical sections assert global feasibility without proof and need revision.","tokens_in":13382,"tokens_out":1772,"would_cite":true,"duration_ms":21141,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"By pairing a control barrier function with a flexible auxiliary function, this paper derives a supermartingale certificate that yields tighter finite-horizon exit-probability bounds for discrete-time stochastic systems with Gaussian…","keywords":["control barrier functions","stochastic safety","discrete-time systems","supermartingale","Ville's inequality","exit probability","quadratic barrier functions","Gaussian noise"],"falsifier":"Take the inverted-pendulum or obstacle-avoidance example and test the safety filter at a grid of states inside the safe set, including states far from the origin; if any state has no feasible control or if a Monte-Carlo run with many more than 500 trials exits more often than the claimed bound, the central guarantee fails.","tokens_in":12329,"feed_emoji":"🛡️","tokens_out":6361,"duration_ms":55430,"temperature":0.7,"pith_summary":"This paper establishes a unified sufficient condition for a discrete-time stochastic control system with Gaussian disturbances to stay inside a prescribed safe set with high probability over a finite horizon. The condition pairs a control barrier function h with a flexible auxiliary function Φ, requiring that Φ(h) form a supermartingale along the closed-loop trajectory. When the condition holds, the K-step exit probability is bounded by Φ(h(x0),0) divided by the minimum of Φ(0,k) over the horizon. The paper shows this generalizes earlier linear bounds and specializes to closed-form conditions for affine and quadratic barrier functions, including unbounded safe sets such as obstacle avoidance. The practical payoff is a safety filter that yields tighter probabilistic safety guarantees than existing methods while remaining computable as a, often convex, optimization problem.","feed_headline":"Barrier functions tighten safety bounds for noisy control","feed_subtitle":"For stochastic systems with Gaussian noise, a flexible barrier certificate yields sharper exit-probability bounds, even for unbounded safe…","key_machinery":"The load-bearing object is the auxiliary function Φ(h,k), which is nonnegative and decreasing in h. It converts the control barrier function condition into a supermartingale certificate: inequality (13) is exactly the requirement that Φ(h(x_{k∧τ}), k∧τ) is a nonnegative supermartingale. Ville's inequality then turns the supermartingale into a probability tail bound. The exponential choice Φ(h,k)=exp(-h)+(K-k)β for quadratic h makes the conditional expectation in (13) computable in closed form through a Gaussian integral, giving the explicit feasibility condition (29) and bound (33). The scaling trick h↦ah, a≥1, tightens the bound without changing the safe set.","core_discovery":"The central claim is Theorem 6: if there exists a control satisfying the supermartingale-like inequality E[Φ(h(F(x,u)+w_k),k+1)|F_k] ≤ Φ(h(x),k) for every state in the safe set, then the probability that the trajectory exits C within K steps is at most Φ(h(x0),0)/min_{0≤k≤K} Φ(0,k). The proof applies the supermartingale tail bound of Ville's inequality to the stopped process Φ(h(x_{k∧τ}), k∧τ). This one bound unifies and improves earlier results: linear choices of Φ give the known affine bounds, while a careful choice of Φ tightens the exit probability substantially. For quadratic CBFs h(x)=xᵀAx+bᵀx+c with Λ=1/$2Σ^{{-1}}$+A positive definite, Theorem 11 shows that Φ(h,k)=exp(-h)+(K-k)β works, producing the explicit bound exp(-h(x0))+Kβ and reducing the safety condition to a tractable inequality involving a Gaussian integral completion. The result extends to unbounded safe sets, which previous bounded-barrier approaches could not handle.","pith_inferences":["The same supermartingale argument should extend to sub-Gaussian or bounded noise, since only the moment-generating behavior of the disturbance matters; the Gaussian assumption is used for the closed-form integral but not for the martingale structure.","The scaling parameter a is a free design knob that could be optimized online to adapt safety margin to the current state, though the paper does not explore this.","Because the bound (14) only requires Φ nonnegative and decreasing, other families of Φ, such as polynomial or piecewise-exponential, might yield even tighter bounds while preserving convexity of the safety filter.","The feasibility check at selected points, rather than over all of C, is the main gap between the theorem's assumptions and its numerical practice; a region-based verification would close it."],"forward_implications":["The exponential auxiliary function gives finite-horizon probabilistic safety certificates for unbounded safe sets, such as obstacle avoidance with quadratic CBFs, where bounded-barrier methods cannot apply.","The bound (33) is tighter than the linear bound of Theorem 4; in the inverted-pendulum example the 100-step exit-probability bound drops from about 21.1% to about 0.10%.","When the barrier is concave and the auxiliary function is convex, the safety-filter optimization is convex, so the filter can be implemented online with standard convex solvers.","Multiple CBFs can be combined via Boole's inequality, allowing the same framework to certify safety in environments with several obstacles.","The scaling parameter a provides a direct trade-off between the tightness of the probability bound and the size of the feasible control set."],"supporting_citations":[{"why":"Supplies the supermartingale tail bound (Lemma 2) that converts the barrier condition into an exit-probability inequality.","marker":"Ville (1939)"},{"why":"Provides the baseline Theorem 4 with linear bounds that the paper generalizes and tightens.","marker":"Cosner et al. (2024)"},{"why":"Contributes the Gaussian-integral completion technique used to derive the closed-form exponential supermartingale condition for quadratic barriers.","marker":"Steinhardt and Tedrake (2012)"},{"why":"Establishes the polynomial barrier supermartingale verification approach that Proposition 8 extends and compares against.","marker":"Santoyo et al. (2021)"},{"why":"First showed how nonnegative supermartingales of barrier functions bound exit probabilities, the foundation of the framework.","marker":"Kushner (1966, 1967)"}],"fun_headline_variants":["Flexible CBFs yield tighter exit-probability bounds for noisy control","Quadratic barrier functions sharpen safety guarantees for stochastic systems","New affine and quadratic CBFs give less conservative safe bounds","Stochastic safety with flexible barrier certificates and unbounded sets","Tighter exit probabilities for noisy control via quadratic CBFs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole guarantee rests on the assumption that at every state inside the safe set and every time step there exists a control satisfying the supermartingale inequality; the paper only verifies this at selected points and asserts it holds throughout the safe set.","fun_headline_variants_meta":{"raw":{"variants":["Flexible CBFs yield tighter exit-probability bounds for noisy control","Quadratic barrier functions sharpen safety guarantees for stochastic systems","New affine and quadratic CBFs give less conservative safe bounds","Stochastic safety with flexible barrier certificates and unbounded sets","Tighter exit probabilities for noisy control via quadratic CBFs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000712,"raw_usage":{"total_tokens":3157,"prompt_tokens":852,"completion_tokens":2305,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":468,"completion_tokens_details":{"reasoning_tokens":2219}},"tokens_in":468,"tokens_out":2305,"duration_ms":16189,"temperature":1.0,"reasoning_tokens":2219,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T20:07:29.045022+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the inverted-pendulum or obstacle-avoidance example and test the safety filter at a grid of states inside the safe set, including states far from the origin; if any state has no feasible control or if a Monte-Carlo run with many more than 500 trials exits more often than the claimed bound, the central guarantee fails.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the supermartingale tail bound (Lemma 2) that converts the barrier condition into an exit-probability inequality."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the baseline Theorem 4 with linear bounds that the paper generalizes and tightens."},{"cited_title":"and Tedrake, R","cited_arxiv_id":null,"evidence_quote":"Contributes the Gaussian-integral completion technique used to derive the closed-form exponential supermartingale condition for quadratic barriers."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes the polynomial barrier supermartingale verification approach that Proposition 8 extends and compares against."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"First showed how nonnegative supermartingales of barrier functions bound exit probabilities, the foundation of the framework."}],"review_version":1}