Detectability of Boolean Control Networks

Zhang, Kuize; Zhang, Lijun; Xie, Lihua

doi:10.1007/978-3-030-25972-3_5

Kuize Zhang⁸,
Lijun Zhang⁹ &
Lihua Xie¹⁰

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

657 Accesses

Abstract

In Chap. 4, we discuss observability of Boolean control networks (BCNs). Intuitively, a BCN is observable if one can use an input sequence and the corresponding output sequence to determine the initial state. Once the initial state has been obtained, all subsequent states can be determined by input sequences since a BCN is deterministic.

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

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 84.99; Price excludes VAT (USA)

Softcover Book: USD 109.99; Price excludes VAT (USA)

Hardcover Book: USD 109.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

1.
Parts of Sects. 5.2, 5.3, and 5.4 were reproduced from Zhang et al. (2016) with permission @ 2016 Society for Industrial and Applied Mathematics.

References

Eppstein D (1990) Reset sequences for monotonic automata. SIAM J Comput 19(3):500–510
Article MathSciNet Google Scholar
Fornasini E, Valcher ME (2013) Observability, reconstructibility and state observers of Boolean control networks. IEEE Trans Autom Control 58(6):1390–1401
Article MathSciNet Google Scholar
Kari J (2003) Synchronizing finite automata on Eulerian digraphs. Theor Comput Sci 295(1):223–232
Article MathSciNet Google Scholar
Linz P (2006) An introduction to formal language and automata. Jones and Bartlett Publishers Inc, USA
MATH Google Scholar
Sandberg S (2005) Homing and synchronizing sequences. In: Broy M et al (eds) Model-based testing of reactive systems: advanced lectures. Springer, Berlin, pp 5–33
Chapter Google Scholar
Zhang K, Zhang L, Su R (2016) A weighted pair graph representation for reconstructibility of Boolean control networks. SIAM J Control Optim 54(6):3040–3060
Article MathSciNet Google Scholar
Zhang Z, Leifeld T, Zhang P (2017) Identification of Boolean control networks incorporating prior knowledge. In: 2017 IEEE 56th annual conference on decision and control (CDC), pp. 5839–5844
Google Scholar

Download references

Author information

Authors and Affiliations

School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden
Kuize Zhang
School of Marine Science and Technology, Northwestern Polytechnical University, Xi’an, China
Lijun Zhang
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore
Lihua Xie

Authors

Kuize Zhang
View author publications
You can also search for this author in PubMed Google Scholar
Lijun Zhang
View author publications
You can also search for this author in PubMed Google Scholar
Lihua Xie
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kuize Zhang .

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Zhang, K., Zhang, L., Xie, L. (2020). Detectability of Boolean Control Networks. In: Discrete-Time and Discrete-Space Dynamical Systems. Communications and Control Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-25972-3_5

Download citation

DOI: https://doi.org/10.1007/978-3-030-25972-3_5
Published: 07 August 2019
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25971-6
Online ISBN: 978-3-030-25972-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)

Publish with us

Policies and ethics