Skip to main content
Log in

On the observability of free Boolean networks via the semi-tensor product method

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper investigates the observability of free Boolean networks by using the semi-tensor product method, and presents some new results. First, the concept of observability for free Boolean networks is proposed, based on which and the algebraic form of Boolean networks, a kind of observability matrix is constructed. Second, by the observability matrix, a new necessary and sufficient condition is given for the observability of Boolean networks. Third, the concept of observability index for observable Boolean networks is defined, and an algorithm is established to calculate the observability index. Finally, a practical example of D. Melanogaster segmentation polarity gene networks is studied to support our new results. The study of the illustrative example shows that the new results obtained in this paper are very effective in investigating the observability of free Boolean networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aldana M, Boolean dynamics of networks with scale-free topology, Physica D, 2003, 185(1): 45–66.

    Article  MATH  MathSciNet  Google Scholar 

  2. Kauffman S A, Metabolic stability and epigenesis in randomly constructed genetic nets, J. Theoretical Biology, 1969, 22(3): 437–467.

    Article  Google Scholar 

  3. Xiao Y and Dougherty E R, The impact of function perturbations in Boolean networks, Bioinformatics, 2007, 23(10): 1265–1273.

    Article  Google Scholar 

  4. Akutsu T, Hayashida M, Ching W, and Ng M K, Control of Boolean networks: hardness results and algorithms for tree structured networks, J. Theoretical Biology, 2007, 244(4): 670–679.

    Article  MathSciNet  Google Scholar 

  5. Cheng D and Qi H, Semi-Tensor Product of Matrices-Theory and Applications, Science Press, Beijing, 2007.

    Google Scholar 

  6. Cheng D, Qi H, and Li Z, Analysis and Control of Boolean Networks: A Semi-Tensor Product Approach, Springer, London, 2011.

    Book  Google Scholar 

  7. Cheng D and Qi H, Controllability and observability of Boolean control networks, Automatica, 2009, 45(7): 1659–1667.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhao Y, Li Z, and Cheng D, Optimal control of logical control networks, IEEE Trans. Aut. Contr., 2011, 56(8): 1766–1776.

    Article  MathSciNet  Google Scholar 

  9. Zhao Y, Cheng D, and Qi H, Input-state incidence matrix of Boolean control networks and its applications, Syst. Contr. Letters, 2010, 59(12): 767–774.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Cheng D and Zhao Y, Identification of Boolean control networks, Automatica, 2011, 47(4): 702–710.

    Article  MATH  MathSciNet  Google Scholar 

  12. Li F and Sun J, Controllability of Boolean control networks with time delays in states, Automatica, 2011, 47(3): 603–607.

    Article  MATH  MathSciNet  Google Scholar 

  13. Li F and Sun J, Controllability of probabilistic Boolean control networks, Automatica, 2011, 47(12): 2765–2771.

    Article  MATH  MathSciNet  Google Scholar 

  14. Li H and Wang Y, Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method, Automatica, 2012, 48(4): 688–693.

    Article  MATH  MathSciNet  Google Scholar 

  15. Li H and Wang Y, On reachability and controllability of switched Boolean control networks, Automatica, 2012, 48(11): 2917–2922.

    Article  MATH  MathSciNet  Google Scholar 

  16. Liu Z and Wang Y, Reachability/controllability of high order mix-valued logical networks, Journal of Systems Science and Complexity, 2013, 26(3): 341–349.

    Article  MATH  MathSciNet  Google Scholar 

  17. Lou Y and Hong Y, Multi-agent decision in Boolean networks with private information and switching interconnection, Proceedings of the 29th Chinese Control Conference, Beijing, 2010.

    Google Scholar 

  18. Xu X and Hong Y, Solvability and control design for synchronization of Boolean networks, Journal of Systems Science and Complexity, 2013, 26(6): 871–885.

    Article  MathSciNet  Google Scholar 

  19. Wang Y, Zhang C, and Liu Z, A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems, Automatica, 2012, 48(7): 1227–1236.

    Article  MATH  MathSciNet  Google Scholar 

  20. Xu X and Hong Y, Matrix approach to model matching of asynchronous sequential machines, IEEE Trans. Aut. Contr., 2013, 58(11): 2974–2979.

    Article  MathSciNet  Google Scholar 

  21. Xu X and Hong Y, Matrix expression and reachability analysis of finite automata, J. Contr. Theory Appl., 2012, 10: 210–215.

    Article  MathSciNet  Google Scholar 

  22. Li Z, Qiao Y, Qi H, and Cheng D, Stability of switched polynomial systems, Journal of Systems Science and Complexity, 2008, 21(3): 362–377.

    Article  MathSciNet  Google Scholar 

  23. Kobayashi K and Imura J, Observability analysis of Boolean networks with biological applications, ICROS-SICE International Joint Conference, Japan, 2009.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haitao Li.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant Nos. 61034007, 61174036, and 61374065, and the Research Fund for the Taishan Scholar Project of Shandong Province of China.

This paper was recommended for publication by Editor LÜ Jinhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., Wang, Y. & Liu, Z. On the observability of free Boolean networks via the semi-tensor product method. J Syst Sci Complex 27, 666–678 (2014). https://doi.org/10.1007/s11424-014-2058-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-2058-4

Keywords

Navigation