Metraipolis › archive › dc_c8fe5f50d8ee
Fast Constraint Extraction for Corrective Control under STL Specifications via Logical Dependency Tracking — arXiv:2609.09439
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.09439
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T11:12:11.159Z
- SHA-256 of the archived text
9e1b2dd861121264c0b45763f56db4643684100e488d82b6a8f92d8ae8f6b94e- Stable URL of this page
https://metraipolis.com/documento/dc_c8fe5f50d8ee
How to cite
Fast Constraint Extraction for Corrective Control under STL Specifications via Logical Dependency Tracking — arXiv:2609.09439 — arXiv (en), https://arxiv.org/abs/2609.09439 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c8fe5f50d8ee (Metraipolis archive dc_c8fe5f50d8ee, sha256 9e1b2dd861121264c0b45763f56db4643684100e488d82b6a8f92d8ae8f6b94e)
BibTeX
@misc{dcc8fe5f50d8ee,
title = {Fast Constraint Extraction for Corrective Control under STL Specifications via Logical Dependency Tracking — arXiv:2609.09439},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.09439},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c8fe5f50d8ee; sha256 9e1b2dd861121264c0b45763f56db4643684100e488d82b6a8f92d8ae8f6b94e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09439. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Ensuring the satisfaction of Signal Temporal Logic (STL) specifications under uncertainty is challenging, as reachability-based monitoring provides guarantees but does not indicate how to restore satisfaction when it becomes indeterminate. A key difficulty is identifying which uncertain components actually affect global satisfaction, especially for nested formulas. This paper introduces a logical dependency tracking framework that propagates uncertainty through the STL structure and captures the causal contribution of reachable sets to satisfaction. By associating markers to uncertain predicates and propagating them via three-valued semantics, we extract in milliseconds a compact Disjunctive Normal Form (DNF) of sufficient constraints, avoiding combinatorial enumeration. As an application, we formulate control correction as a minimum-effort optimization problem. Using zonotopic reachability, the derived constraints are enforced via linear programming, yielding corrections that guarantee STL satisfaction under bounded uncertainty and provide certified probabilistic bounds in the stochastic case. We demonstrate the approach on a nonlinear system with nested STL specifications, showing that dependency tracking enables efficient and formally guaranteed correction. The tracking implementation is available at this https URL . Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-10 in cs.RO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Robotics (cs.RO); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.09439 — 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-16T10:19:11.940Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).