Metraipolis › archive › dc_e499c40f2a33

Sufficient and Necessary Continuous Barrier-like Conditions for Discrete-Time Stochastic Reach-Avoid Verification — arXiv:2609.23973

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23973
License (as archived)
CC0-1.0
Archived
2026-10-10T00:55:29.052Z
SHA-256 of the archived text
0406d7875db18b0996cabe29eda12ff76bcda65c626100a0d130330074c2cce3
Stable URL of this page
https://metraipolis.com/documento/dc_e499c40f2a33

How to cite

Sufficient and Necessary Continuous Barrier-like Conditions for Discrete-Time Stochastic Reach-Avoid Verification — arXiv:2609.23973 — arXiv (en), https://arxiv.org/abs/2609.23973 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e499c40f2a33 (Metraipolis archive dc_e499c40f2a33, sha256 0406d7875db18b0996cabe29eda12ff76bcda65c626100a0d130330074c2cce3)
BibTeX
@misc{dce499c40f2a33,
  title = {Sufficient and Necessary Continuous Barrier-like Conditions for Discrete-Time Stochastic Reach-Avoid Verification — arXiv:2609.23973},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23973},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e499c40f2a33; sha256 0406d7875db18b0996cabe29eda12ff76bcda65c626100a0d130330074c2cce3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23973. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper develops necessary and sufficient barrier-like characterizations using continuous barrier functions for infinite-horizon reach-avoid verification of discrete-time stochastic systems. Existing results establish necessary and sufficient conditions in terms of functional inequalities involving measurable or lower semicontinuous barrier functions. However, the limited regularity of such functions may hinder their numerical approximation and computational synthesis. Building on our previous barrier-like condition for finite-horizon reach-avoid verification, we show that this condition can also be used for infinite-horizon reach-avoid verification and, under a uniform absolute continuity condition on the transition kernels, admits a continuous barrier function whenever the exact reach-avoid probability is strictly larger than the prescribed threshold for every state in the initial set. We further show that the resulting continuous barrier function can be uniformly approximated by a polynomial one while preserving the required barrier-like conditions. For polynomial systems, we formulate these conditions as polynomial positivity constraints over compact basic semialgebraic sets. Putinar's Positivstellensatz then converts the positivity conditions into sum-of-squares (SOS) certificates, yielding semidefinite programming (SDP) formulations for synthesizing polynomial barrier functions. We establish both soundness and completeness of the resulting SOS-based procedure. Finally, two numerical examples illustrate the theoretical results and demonstrate the resulting SDP approach.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.23973 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T23:57:37.627Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).