Abstract
This study investigates the set reachability of Markovian jump Boolean networks (MJBNs). Firstly, through comprehensive analysis, two kinds of set reachability, strong set reachability and weak set reachability, are defined. By using semi-tensor product of matrices, the considered MJBN is converted into a Markov chain which can not only describe the state transition of the MJBN synchronously, but also maintain its transition probability. Based on this, the set reachability problem of the MJBN is transformed into the reachability and convergence problems of the corresponding Markov chain. Then some necessary and sufficient conditions for set reachability of MJBNs are obtained. Finally, the observability and output stability problems of MJBNs are discussed as two applications of set reachability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
