Pith. sign in

REVIEW

Complete Abstractions of Monotone Control Systems: From Model-based to Data-Driven Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2608.06689 v1 pith:4D7I6VAN submitted 2026-08-07 eess.SY cs.SY

classification eess.SYcs.SY
keywords systemsabstractioncontrollerabstractionssystemabsencecompletedata-driven
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we introduce the approximate strong upper alternating simulation (ASUAS), a new behavioral relation for transition systems. Building on this relation, we construct upper- and lower-sparse abstractions for monotone systems that together form a complete abstraction pair: any controller synthesized for the upper-sparse abstraction can be refined into a controller for the original system, and the absence of a controller for the lower-sparse abstraction implies the absence of a controller for the original system. A key feature of our approach is the ability to provably tune the conservativeness gap between the two abstractions by tuning the space-discretization parameter. We further extend these results, beyond the model-based setting, to data-driven systems, where the abstraction is constructed directly from finite sampled data, without requiring an explicit system model. The theoretical results are illustrated through simulations.

Discussion (0). Continue with ORCID to comment.

Pith tools