Open AccessSet reachability of Markovian jump Boolean networks and its applications
Author(s) -
Zhang Qingle,
Feng June,
Wang Biao
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2020.0027
Subject(s) - reachability , markov chain , set (abstract data type) , observability , markov process , mathematics , markov decision process , jump , computer science , discrete mathematics , algorithm , statistics , programming language , physics , quantum mechanics
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.