mlsanityData to 14 Oct 2026

Safe Domains of Attraction for Discrete-Time Nonlinear Systems: Characterization and Verifiable Neural Network Estimation

arXiv 2506.13961 ↗First posted 16 Jun 2025eess.SY cs.AI cs.SYcited by 3

Not on the map. Why?

Abstract (arXiv)

Analysis of nonlinear autonomous systems typically involves estimating domains of attraction, which have been a topic of extensive research interest for decades. Despite that, accurately estimating domains of attraction for nonlinear systems remains a challenging task, where existing methods are conservative or limited to low-dimensional systems. The estimation becomes even more challenging when accounting for state constraints. In this work, we propose a framework to accurately estimate safe (state-constrained) domains of attraction for discrete-time autonomous nonlinear systems. In establishing this framework, we first derive a new Zubov equation, whose solution corresponds to the exact safe domain of attraction. The solution to the aforementioned Zubov equation is shown to be unique and continuous over the whole state space. We then present a physics-informed approach to approximating the solution of the Zubov equation using neural networks. To obtain certifiable estimates of the domain of attraction from the neural network approximate solutions, we propose a verification framework that can be implemented using standard verification tools (e.g., α,!β-CROWN and dReal). To illustrate its effectiveness, we demonstrate our approach through numerical examples concerning nonlinear systems with state constraints.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 17 of its 33 references that are in the map. First posted on arXiv 16 Jun 2025.

Builds on

17 of 33 references.

References · 17

  1. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
  2. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 228
  3. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 187
  4. 2020Neural Lyapunov Controlcited by 142
  5. 2019Branch and Bound for Piecewise Linear Neural Network Verificationcited by 138
  6. 2022Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Boundcited by 92
  7. 2021Lyapunov-stable neural-network controlcited by 66
  8. 2024Neural Network Verification with Branch-and-Bound for General Nonlinearitiescited by 47
  9. 2022Neural Lyapunov Control of Unknown Nonlinear Systems with Stability Guaranteescited by 40
  10. 2024Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planescited by 33
  11. 2024Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulationcited by 25
  12. 2023Neural Lyapunov Control for Discrete-Time Systemscited by 23
5 more
  1. 2023Physics-Informed Neural Network Lyapunov Functions: PDE Characterization, Learning, and Verificationcited by 20
  2. 2021Learning Region of Attraction for Nonlinear Systemscited by 16
  3. 2023Fossil 2.0: Formal Certificate Synthesis for the Verification and Control of Dynamical Modelscited by 15
  4. 2024LyZNet: A Lightweight Python Tool for Learning and Verifying Neural Lyapunov Functions and Regions of Attractioncited by 10
  5. 2024Underapproximating Safe Domains of Attraction for Discrete-Time Systems Using Implicit Representations of Backward Reachable Setscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.