Metraipolis › archive › dc_ea7ad529b359
Comparison Invariants for Verifying Control Invariance — arXiv:2608.24598
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24598
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:06:55.481Z
- SHA-256 of the archived text
9fae0adadcf5c0164cae65b4021af5487dd465e5f9bcd292c960adb305ee18c1- Stable URL of this page
https://metraipolis.com/documento/dc_ea7ad529b359
How to cite
Comparison Invariants for Verifying Control Invariance — arXiv:2608.24598 — arXiv (en), https://arxiv.org/abs/2608.24598 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea7ad529b359 (Metraipolis archive dc_ea7ad529b359, sha256 9fae0adadcf5c0164cae65b4021af5487dd465e5f9bcd292c960adb305ee18c1)
BibTeX
@misc{dcea7ad529b359,
title = {Comparison Invariants for Verifying Control Invariance — arXiv:2608.24598},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24598},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea7ad529b359; sha256 9fae0adadcf5c0164cae65b4021af5487dd465e5f9bcd292c960adb305ee18c1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24598. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Control invariance validates that dynamical systems have a control input that preserves a given property at all times. This paper introduces a set of sound axioms and proof rules in differential dynamic logic (dL) that enable verification of control invariance. First, the scalar and vector comparison principles, relating a system of differential equations to a comparison system such that invariance properties can be established more easily, are axiomatized in dL. This axiomatization primarily utilizes differential ghosts, which are proof-theoretic generalizations of comparison systems. Next, with the comparison principles serving as the basis, comparison invariants are introduced, and sound axioms and proof rules are derived. Comparison invariants reduce the question of control invariance to a functional inequality on its Lie derivative for a suitable class of functions, moreover, the right choice of function can result in decidable arithmetic. Furthermore, the perennially popular control barrier functions (CBFs) used in safety-critical control are shown to be a special instance of comparison invariants. This yields an axiomatization of CBFs that leads to a dedicated set of proof rules. The rules allow for the verification of CBFs, which are traditionally used for synthesizing safe controllers without verification. Lastly, comparison invariants are shown to unify several other safety verification techniques, including Darboux invariants and differential invariants, further cementing their versatility. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.24598 — 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-18T07:02:03.046Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).