Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Positive Systems

POSTA 2018: Positive Systems pp 289–298Cite as

Identifiability of Boolean Networks via Output Data and Initial States

  • Chapter
  • First Online:

  • 465 Accesses

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 480))

Abstract

In this paper, identifiability of Boolean networks is investigated via output data and initial states. The identifiability can be equivalently converted into solving a system of logical matrix equations, which are constructed from the output data. Based on which, some necessary and sufficient conditions are established to calculate structure matrices of the concerned plant. Finally, an example is discussed to show that the obtained results are effective.

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

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    States in \(\varDelta _{2^n}\setminus S_R(0)\) are distinguishable, if for any \(x_0\in \varDelta _{2^n}\setminus S_R(0)\) and \(x_0'\in \varDelta _{2^n}\), \(x_0\ne x_0'\) are distinguishable.

References

  1. Albert, R., Othmer, H.: The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. J. Theor. Biol. 223(1), 1–18 (2003)

    Article  MathSciNet  Google Scholar 

  2. Chen, H., Liang, J., Lu, J., Qiu, J.: Synchronization for the realization-dependent probabilistic Boolean networks. IEEE Trans. Neural Netw. Learn. Syst. 29(4), 819–831 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Cheng, D., Qi, H., Li, Z.: Analysis and Control of Boolean Networks: A Semi-Tensor Product Approach. Springer Science & Business Media, Berlin (2010)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Cheng, D., Qi, H., Li, Z.: Model construction of Boolean network via observed data. IEEE Trans. Neural Netw. 22(4), 525–536 (2011)

    Article  Google Scholar 

  8. Cheng, D., He, F., Qi, H., Xu, T.: Modeling, analysis and control of networked evolutionary games. IEEE Trans. Autom. Control 60(9), 2402–2415 (2015)

    Article  MathSciNet  Google Scholar 

  9. Fornasini, E., Valcher, M.: Observability, reconstructibility and state observers of Boolean control networks. IEEE Trans. Autom. Control 58(6), 1390–1401 (2013)

    Article  MathSciNet  Google Scholar 

  10. Fornasini, E., Valcher, M.: Identification problems for Boolean networks and Boolean control networks. IFAC Proc. Vol. 47(3), 5399–5404 (2014)

    Article  Google Scholar 

  11. Hassoun, M.H.: Fundamentals of Artificial Neural Networks. The MIT Press, Cambridge (1995)

    Google Scholar 

  12. Kauffman, S.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22(3), 437–467 (1969)

    Article  MathSciNet  Google Scholar 

  13. Kauffman, S., Peterson, C., Samuelsson, B., Troein, C.: Random Boolean network models and the yeast transcriptional network. Proc. Natl. Acad. Sci. 100(25), 14796–14799 (2003)

    Article  Google Scholar 

  14. Laschov, D., Margaliot, M., Even, G.: Observability of Boolean networks: a graph-theoretic approach. Automatica 49(8), 2351–2362 (2013)

    Article  MathSciNet  Google Scholar 

  15. Liang, S., Fuhrman, S., Somogyi, R.: Reveal: a general reverse engineering algorithm for inference of genetic network architectures. In: Pacific Symposium on Biocomputing Pacific Symposium on Biocomputing, pp. 18–29 (1998)

    Google Scholar 

  16. Nam, D., Seo, S., Kim, S.: An efficient top-down search algorithm for learning Boolean networks of gene expression. Mach. Learn. 65(1), 229–245 (2006)

    Article  Google Scholar 

  17. Tatsuya, A., Satoru, M., Satoru, K.: Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. J. Comput. Biol. Int. Conf. Comput. Mol. Cell Biol. 7(3–4), 331–343 (2000)

    Google Scholar 

  18. Yao, J., Feng, J., Meng, M.: On solutions of the matrix equation \(AX=B\) with respect to semi-tensor product. J. Franklin Inst. 353(5), 1109–1131 (2016)

    Article  MathSciNet  Google Scholar 

  19. Yu, Y., Feng, J., Pan, J., Cheng, D.: Block decoupling of Boolean control networks. IEEE Trans. Autom. Control. https://doi.org/10.1109/TAC.2018.2880411 (2017)

  20. Zhang, X., Han, H., Zhang, W.: Identification of Boolean networks using premined network topology information. IEEE Trans. Neural Netw. Learn. Syst. 28(2), 464–469 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation (NNSF) of China under Grant 61773371.

Author information

Authors and Affiliations

  1. School of Mathematics, Shandong University, 27 Shanda Nanlu, Jinan, Shandong, 250100, People’s Republic of China

    Yongyuan Yu & Jun-E Feng

Authors
  1. Yongyuan Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-E Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun-E Feng .

Editor information

Editors and Affiliations

  1. Department of Mechanical Engineering, University of Hong Kong, Hong Kong, Hong Kong

    James Lam

  2. Hangzhou Dianzi University, Hangzhou, China

    Yun Chen

  3. Southwest Minzu University, Chengdu, China

    Xingwen Liu

  4. Dalian University of Technology, Dalian, China

    Xudong Zhao

  5. Hangzhou Dianzi University, Hangzhou, China

    Junfeng Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Yu, Y., Feng, JE. (2019). Identifiability of Boolean Networks via Output Data and Initial States. In: Lam, J., Chen, Y., Liu, X., Zhao, X., Zhang, J. (eds) Positive Systems . POSTA 2018. Lecture Notes in Control and Information Sciences, vol 480. Springer, Cham. https://doi.org/10.1007/978-3-030-04327-8_23

Download citation

Publish with us

Policies and ethics

Search

Navigation