Pith. sign in

REVIEW

Sparsity-Sensitive Finite Abstraction

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 1704.03951 v1 pith:OJIQG4JZ submitted 2017-04-12 cs.SY cs.SY

classification cs.SY
keywords abstractionalgorithmcontrollerdimensionaldimensionsfiniteinputmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Abstraction of a continuous-space model into a finite state and input dynamical model is a key step in formal controller synthesis tools. To date, these software tools have been limited to systems of modest size (typically $\leq$ 6 dimensions) because the abstraction procedure suffers from an exponential runtime with respect to the sum of state and input dimensions. We present a simple modification to the abstraction algorithm that dramatically reduces the computation time for systems exhibiting a sparse interconnection structure. This modified procedure recovers the same abstraction as the one computed by a brute force algorithm that disregards the sparsity. Examples highlight speed-ups from existing benchmarks in the literature, synthesis of a safety supervisory controller for a 12-dimensional and abstraction of a 51-dimensional vehicular traffic network.

Discussion (0). Continue with ORCID to comment.

Pith tools