Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Observability of Nonlinear Dynamical Systems over Finite Fields (2404.02336v1)

Published 2 Apr 2024 in eess.SY, cs.SY, and math.DS

Abstract: This paper discusses the observability of nonlinear Dynamical Systems over Finite Fields (DSFF) through the Koopman operator framework. In this work, given a nonlinear DSFF, we construct a linear system of the smallest dimension, called the Linear Output Realization (LOR), which can generate all the output sequences of the original nonlinear system through proper choices of initial conditions (of the associated LOR). We provide necessary and sufficient conditions for the observability of a nonlinear system and establish that the maximum number of outputs sufficient for computing the initial condition is precisely equal to the dimension of the LOR. Further, when the system is not known to be observable, we provide necessary and sufficient conditions for the unique reconstruction of initial conditions for specific output sequences.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. A R Gill, “Linear Sequential Circuits: Analysis, Synthesis and Applications”, McGraw-Hill, 1966.
  2. A R Gill, “Introduction to the Theory of Finite State Machines”, McGraw-Hill, 1962.
  3. R Anantharaman and V Sule, “Koopman operator approach for computing structure of solutions and Observability of non-linear dynamical system over finite fields”, Math. of Control, Signals and Systems, Vol. 33, 2021, pp. 331-358.
  4. D Cheng and H Qi, “Controllability and observability of Boolean control networks”, Automatica, vol 45, 2009, pp 1659-1667.
  5. E Fornasini and M E Valcher, “Observability, Reconstructibility and State Observers of Boolean Control Networks”, IEEE Tr. on Automatic Control, vol. 58(6), 2013,pp 1390-1401.
  6. D Laschov and M Margaliot and G Even, “Observability of Boolean networks: A graph-theoretic approach”, Automatica, vol.49, 2013, pp 2351-2362.
  7. E Weiss and M Margaliot, “A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks”, IEEE Tr. on Automatic Control, vol. 64, 2018, pp. 2727 - 2736.
  8. D Cheng and H Qi, “State–Space Analysis of Boolean Networks”, IEEE Tr. on Neural Networks, vol. 21, 2010, pp. 584-594.
  9. B Koopman, “Hamiltonian systems and transformation in Hilbert space”, Proc. of the National Acad. of Sciences of the USA, vol. 17(5), 1931, pp. 315-318.
  10. L Bettale and J-C Faugère and L Perret, “Hybrid approach for solving multivariate systems over finite fields”, Journal of Mathematical Cryptology, 2009, pp. 177-197.
  11. J Ding and J E Gower and D S Schmidt, “Zhuang-Zi: A new algorithm for solving multivariate polynomial equations over a finite field”,Cryptology ePrint Archive, http://eprint.iacr.org/, 2006.

Summary

We haven't generated a summary for this paper yet.