On persistent excitations for the identification of switched linear dynamical systems over finite fields

This paper discusses the issue of the Persistent Excitation (PE) conditions in the context of identification for dynamical systems defined over a finite field. The work is motivated by the fact that the asymptotical property of the PE conditions for dynamical systems defined over the field of real numbers is no longer valid in the case of systems defined over finite fields. The special class of switched linear discrete-time systems for which the mode is assumed to be unknown is considered. A necessary and sufficient condition that provides the minimum amount of data required for the identification is first proposed. Next, a necessary condition is derived that gives the structural condition the system must satisfy, regardless of the availability of data. Finally, some computational aspects are discussed and examples are given to illustrate the validity of the proposed results.

[1]  Gérard Bloch,et al.  Identifiability of discrete-time nonlinear systems: The local state isomorphism approach , 2008, Autom..

[2]  Edgar Delgado-Eckert,et al.  Boolean monomial control systems , 2009 .

[3]  A. Benveniste,et al.  Dynamical systems over Galois fields and DEDS control problems , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[4]  Shreyas Sundaram,et al.  Information dissemination in networks via linear iterative strategies over finite fields , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[5]  P. R. Kumar,et al.  Discrete Event Systems, Manufacturing Systems, and Communication Networks , 1997 .

[6]  Dorothy Bollman,et al.  A Control Theory for Boolean Monomial Dynamical Systems , 2010, Discret. Event Dyn. Syst..

[7]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[8]  Abdul Salam Jarrah,et al.  Parameter estimation for Boolean models of biological networks , 2009, Theor. Comput. Sci..

[9]  Luciano Lavagno,et al.  Synthesis and Control of Discrete Event Systems , 2002, Springer US.

[10]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[11]  M. Fliess,et al.  Flatness and defect of non-linear systems: introductory theory and examples , 1995 .

[12]  Johann Reger,et al.  Linear Systems over Finite Fields – Modeling, Analysis, and Synthesis , 2004, Autom..

[13]  Graham C. Goodwin,et al.  Adaptive filtering prediction and control , 1984 .

[14]  Shreyas Sundaram,et al.  Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems , 2013, IEEE Transactions on Automatic Control.

[15]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[16]  J. Geromel,et al.  Stability and stabilization of discrete time switched systems , 2006 .

[17]  Brandilyn Stigler,et al.  Polynomial Dynamical Systems in Systems Biology Brandilyn Stigler , 2007 .

[18]  Hidde de Jong,et al.  Symbolic reachability analysis of genetic regulatory networks using discrete abstractions , 2008, Autom..

[19]  Rudolf Lide,et al.  Finite fields , 1983 .

[20]  René Vidal,et al.  Identification of Deterministic Switched ARX Systems via Identification of Algebraic Varieties , 2005, HSCC.

[21]  Edgar Delgado-Eckert,et al.  Discrete Time Systems with Event-Based Dynamics: Recent Developments in Analysis and Synthesis Methods , 2011 .

[22]  MengChu Zhou,et al.  Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.

[23]  N. Bose.  Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[24]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[25]  B. De Schutter,et al.  Max-plus algebra and max-plus linear discrete event systems: An introduction , 2008, 2008 9th International Workshop on Discrete Event Systems.

[26]  S. Weiland,et al.  On the equivalence of switched affine models and switched ARX models , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[27]  Sukumar Nandi,et al.  LCASE: Lightweight Cellular Automata-based Symmetric-key Encryption , 2009, Int. J. Netw. Secur..

[28]  Bart De Schutter,et al.  Model predictive control for stochastic switching max-plus-linear systems , 2012, WODES.

[29]  Abdul Salam Jarrah,et al.  System Identification for Discrete Polynomial Models of Gene Regulatory Networks , 2009 .

[30]  Johan Gunnarsson,et al.  Algebraic Methods for Discrete Event Systems - A Tutorial , 1996 .

[31]  Bonaventure Intercontinental,et al.  ON DECISION AND CONTROL , 1985 .

[32]  E. Delgado-Eckert.  Reverse Engineering Time Discrete Finite Dynamical Systems: A Feasible Undertaking? , 2007, PloS one.

[33]  Jacob Roll,et al.  A necessary and sufficient condition for input-output realization of switched affine state space models , 2008, 2008 47th IEEE Conference on Decision and Control.

[34]  Neil D. Evans,et al.  Structural identifiability of surface binding reactions involving heterogeneous analyte: Application to surface plasmon resonance experiments , 2013, Autom..

[35]  Jamal Daafouz,et al.  Flatness of Switched Linear Discrete-Time Systems , 2009, IEEE Transactions on Automatic Control.

[36]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[37]  Jamal Daafouz,et al.  Left invertibility, flatness and identifiability of switched linear dynamical systems: a framework for cryptographic applications , 2010, Int. J. Control.