Pith. sign in

REVIEW

Minimality and identifiability of discrete-time SARX systems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2002.01818 v1 pith:F3CNQMF2 submitted 2020-02-05 math.OC

M. Petreczky , L. Bako , S. Lecoeuche , K.M.D. Motchon This is my paper · ORCID
classification math.OC
keywords sarxidentifiabilityminimalitysystemsabbreviatedauto-regressiveconceptsconditions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The paper studies the problem of minimality and identifiability for Switched Auto-Regressive eXogenous (abbreviated by SARX) systems. We propose formal definitions of the concepts of identifiability and minimality for SARX models. Based on these formalizations, we derive conditions for minimality and identifiability of SARX systems. In particular, we show that polynomially parametrized SARX systems are generically identifiable.

Discussion (0). Continue with ORCID to comment.

Pith tools