Pith. sign in

REVIEW

Sampled-data reachability analysis using sensitivity and mixed-monotonicity

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 1803.02214 v2 pith:33NSXOJH submitted 2018-03-06 eess.SY cs.SY

classification eess.SYcs.SY
keywords sensitivityapproachcontinuous-timemixed-monotonicityover-approximationresultsystemuncertain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper over-approximates the reachable sets of a continuous-time uncertain system using the sensitivity of its trajectories with respect to initial conditions and uncertain parameters. We first prove the equivalence between an existing over-approximation result based on the sign-stability of the sensitivity matrices and a discrete-time approach relying on a mixed-monotonicity property. We then present a new over-approximation result which scales at worst linearly with the state dimension and is applicable to any continuous-time system with bounded sensitivity. Finally, we provide a simulation-based approach to estimate these bounds through sampling and falsification. The results are illustrated with numerical examples on traffic networks and satellite orbits.

Discussion (0). Continue with ORCID to comment.

Pith tools