Advertisement

Observability of Boolean Control Networks

  • Kuize ZhangEmail author
  • Lijun Zhang
  • Lihua Xie
Chapter
Part of the Communications and Control Engineering book series (CCE)

Abstract

Given a dynamical system, as the system evolves, a state trajectory is generated. Generally speaking, a quantitative analysis of the system closely depends on states of a trajectory. Particularly for a deterministic system, if the initial state has been determined, then the corresponding trajectory will be naturally determined by using an input sequence. That is, the initial state will help understand the whole information of the corresponding trajectory for deterministic systems.

References

  1. Cheng D, Li C, He F (2018) Observability of Boolean networks via set controllability approach. Syst Control Lett 115:22–25MathSciNetCrossRefGoogle Scholar
  2. Cheng D, Qi H (2009) Controllability and observability of Boolean control networks. Automatica 45(7):1659–1667MathSciNetCrossRefGoogle Scholar
  3. Cheng D, Zhao Y (2011) Identification of Boolean control networks. Automatica 47(4):702–710MathSciNetCrossRefGoogle Scholar
  4. Cheng D et al (2016) A note on observability of Boolean control networks. Syst Control Lett 87:76–82MathSciNetCrossRefGoogle Scholar
  5. Fornasini E, Valcher ME (2013) Observability, reconstructibility and state observers of Boolean control networks. IEEE Trans Autom Control 58(6):1390–1401MathSciNetCrossRefGoogle Scholar
  6. Kalman RE, Falb PL, Arbib MA (1969) Topics in mathematical system theory. International series in pure and applied mathematics. McGraw-HillGoogle Scholar
  7. Kalman RE (1963) Mathematical description of linear dynamical systems. J Soc Ind Appl Math Ser Control 1(12):152–192MathSciNetCrossRefGoogle Scholar
  8. Laschov D, Margaliot M, Even G (2013) Observability of Boolean networks: a graphtheoretic approach. Automatica 49(8):2351–2362MathSciNetCrossRefGoogle Scholar
  9. Li R, Yang M, Chu T (2015) Controllability and observability of Boolean networks arising from biology. Chaos: Interdiscip J Nonlinear Sci 25(2), 023104–15MathSciNetCrossRefGoogle Scholar
  10. Li R, Yang M, Chu T (2014) Observability conditions of Boolean control networks. Int J Robust Nonlinear Control 24(17):2711–2723MathSciNetCrossRefGoogle Scholar
  11. Linz P (2006) An introduction to formal language and automata. Jones and Bartlett Publishers Inc, USAzbMATHGoogle Scholar
  12. Moore EF (1956) Gedanken-experiments on sequential machines. Autom Stud, Ann Math Stud 34, 129–153Google Scholar
  13. Sontag ED (1979) On the observability of polynomial systems, I: finite-time problems. SIAM J Control Optim 17:139–151MathSciNetCrossRefGoogle Scholar
  14. Wonham WM (1985) Linear multivariable control: a geometric approach, 3rd edn. Springer, New YorkCrossRefGoogle Scholar
  15. Zhang K, Zhang L (2016) Observability of Boolean control networks: a unified approach based on finite automata. IEEE Trans Autom Control 61(9):2733–2738MathSciNetCrossRefGoogle Scholar
  16. Zhang K, Zhang L (2014) Observability of Boolean control networks: a unified approach based on the theories of finite automata and formal languages. In: Proceedings of the 33rd Chinese control conference, pp 6854-6861Google Scholar
  17. Zhao Y, Qi H, Cheng D (2010) Input-state incidence matrix of Boolean control networks and its applications. Syst Control Lett 59(12):767–774MathSciNetCrossRefGoogle Scholar
  18. Zhu Q et al (2018) Observability of Boolean control networks. Sci China Inf Sci 61(9), 092201Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.School of Electrical Engineering and Computer ScienceKTH Royal Institute of TechnologyStockholmSweden
  2. 2.School of Marine Science and TechnologyNorthwestern Polytechnical UniversityXi’anChina
  3. 3.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingaporeSingapore

Personalised recommendations