Metraipolis › archive › dc_e3e9467e4e8a
A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems — arXiv:2608.10254
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10254
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:37:16.204Z
- SHA-256 of the archived text
aa2400b1f0c4d8ce60cee6ae45d59fd50144f0e113252aa252251e0c511f14df- Stable URL of this page
https://metraipolis.com/documento/dc_e3e9467e4e8a
How to cite
A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems — arXiv:2608.10254 — arXiv (en), https://arxiv.org/abs/2608.10254 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e3e9467e4e8a (Metraipolis archive dc_e3e9467e4e8a, sha256 aa2400b1f0c4d8ce60cee6ae45d59fd50144f0e113252aa252251e0c511f14df)
BibTeX
@misc{dce3e9467e4e8a,
title = {A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems — arXiv:2608.10254},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10254},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e3e9467e4e8a; sha256 aa2400b1f0c4d8ce60cee6ae45d59fd50144f0e113252aa252251e0c511f14df},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10254. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction. To transfer verification guarantees from the abstract model to the concrete CPS, the abstraction must conservatively approximate the concrete state space and behaviors. Hence, model-builders must maintain this soundness while balancing pessimism with tractability. However, they face several common pitfalls such as under-approximating the state space, under-approximating transitions, unsound pruning of "degenerate" behaviors, and improper specification lifting. This tutorial presents a pragmatic, conservative-by-construction workflow for building discrete abstractions of closed-loop dynamical systems. The workflow consists of four modular steps with interchangeable subroutines: (i) state-space partition and abstraction-function design, (ii) conservative transition construction via axis-aligned bounding boxes, polytopes, or sampling with PAC coverage certificates, (iii) mitigation of spurious transitions and self-loops using certified erasure and counterexample-guided abstraction refinement, and (iv) sound lifting of LTL specifications using may-must semantics. We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in cs.LO). Categorie arXiv: Systems and Control (eess.SY) ; Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2608.10254 — 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-19T06:28:34.235Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).