Skip to main content

Part of the book series: Communications and Control Engineering ((CCE))

  • 1587 Accesses

Abstract

This chapter presents a systematic description of state spaces and subspaces of Boolean (control) networks. After defining the state space and subspaces, the coordinate transformation of Boolean (control) networks is proposed. Using coordinate transformation, some useful kinds of subspaces, including regular subspaces and invariant subspaces, are investigated in detail. Moreover, the indistinct rolling gear structure of Boolean networks is revealed. This state-space description makes a state-space approach, similar to that of the modern control theory, applicable to the analysis of Boolean networks and the synthesis of Boolean control systems. This chapter is based on Cheng and Qi (IEEE Trans. Neural. Netw. 21(4):584–594, 2010).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aracena, J., Demongeot, J., Goles, E.: On limit cycles of monotone functions with symmetric connection graph. Theor. Comput. Sci. 322, 237–244 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cheng, D.: Input-state approach to Boolean networks. IEEE Trans. Neural Netw. 20(3), 512–521 (2009)

    Article  Google Scholar 

  3. Cheng, D., Qi, H.: A linear representation of dynamics of Boolean networks. IEEE Trans. Automat. Contr. 55(10), 2251–2258 (2010)

    Article  MathSciNet  Google Scholar 

  4. Cheng, D., Qi, H.: State-space analysis of Boolean networks. IEEE Trans. Neural Netw. 21(4), 584–594 (2010)

    Article  MathSciNet  Google Scholar 

  5. Farrow, C., Heidel, J., Maloney, J., Rogers, J.: Scalar equations for synchronous Boolean networks with biological applications. IEEE Trans. Neural Netw. 15(2), 348–354 (2004)

    Article  Google Scholar 

  6. Heidel, J., Maloney, J., Farrow, C., Rogers, J.: Finding cycles in synchronous Boolean networks with applications to biochemical systems. Int. J. Bifurc. Chaos 13(3), 535–552 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kalman, R.E.: On the general theory of control systems. In: Automatic and Remote Control, Proc. First Internat. Congress, International Federation of Automatic Control, (IFAC), Moscow, 1960, vol. 1, pp. 481–492. Butterworth, Stoneham (1961)

    Google Scholar 

  8. Shih, M.H., Dong, J.L.: A combinatorial analogue of the Jacobian problem in automata networks. Adv. Appl. Math. 34, 30–46 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daizhan Cheng .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Cheng, D., Qi, H., Li, Z. (2011). State Space and Subspaces. In: Analysis and Control of Boolean Networks. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-0-85729-097-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-097-7_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-096-0

  • Online ISBN: 978-0-85729-097-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics