×

Bayesian selection probability estimation for probabilistic Boolean networks. (English) Zbl 1451.93179

Summary: A Bayesian approach to estimate selection probabilities of probabilistic Boolean networks is developed in this study. The concepts of inverse Boolean function and updatable set are introduced to specify states which can be used to update a Bayesian posterior distribution. The analysis on convergence of the posteriors is carried out by exploiting the combination of semi-tensor product technique and state decomposition algorithm for Markov chain. Finally, some numerical examples demonstrate the proposed estimation algorithm.

MSC:

93C29 Boolean control/observation systems
93B70 Networked control
93E03 Stochastic systems in control theory (general)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] S. A.Kauffman, Metabolic stability and epigenesis in randomly constructed genetic nets, J. Theor Biol.22 (1969), 437-467.
[2] D.Cheng, H.Qi, and Z.Li, Analysis and Control of Boolean Networks: A Semi‐tensor Product Approach, Springer, London, 2011. · Zbl 1209.93001
[3] I.Shmulevich et al., Probabilistic boolean networks: A rule‐based uncertainty model for gene regulatory networks, Bioinformatics18 (2002), 261-274.
[4] D.Cheng and H.Qi, A linear representation of dynamics of boolean networks, IEEE Trans Autom. Control55 (2010), 2251-2258. · Zbl 1368.37025
[5] D.Cheng and H.Qi, Controllability and observability of boolean control networks, Automatica45 (2009), 1659-1667. · Zbl 1184.93014
[6] H.Li and Y.Wang, Further results on feedback stabilization control design of boolean control networks, Automatica83 (2017), 303-308. · Zbl 1373.93259
[7] J.Zhong et al., Global robust stability and stabilization of boolean network with disturbances, Automatica84 (2017), 142-148. · Zbl 1376.93079
[8] J.Pan et al., Input‐output decoupling of boolean control networks, Asian J. Control20(2018), 2185-2194. · Zbl 1407.93064
[9] S.Chen et al., Monostability and Bistability of Boolean Networks using Semi‐tensor Products, IEEE Trans. Control Netw. Syst. (2018). https://doi.org/10.1109/TCNS.2018.2889015 · Zbl 1516.93199 · doi:10.1109/TCNS.2018.2889015
[10] Y.Liu et al., Controllability of probabilistic boolean control networks based on transition probability matrices, Automatica52 (2015), 340-345. · Zbl 1309.93026
[11] F.Li and Y.Tang, Set stabilization for switched boolean control networks, Automatica78(2017), 223-230. · Zbl 1357.93079
[12] H.Li, Y.Wang, and Z.Liu, A semi‐tensor product approach to pseudo‐boolean functions with application to Boolean control networks, Asian J. Control16 (2014), 1073-1081. · Zbl 1300.93093
[13] J.Zhao, F.Meng, and Z.Liu, Lyapunov‐based stability of mix‐valued logical networks, Asian J. Control21 (2019), 1307-1317. · Zbl 1432.93267
[14] X.Han et al., Modeling, reachability and controllability of bounded petri nets based on semi‐tensor product of matrices, Asian J. Control (2018). https://doi.org/10.1002/asjc.1915 · doi:10.1002/asjc.1915
[15] D.Cheng, Y.Zhao, and J. B.Liu, Optimal control of finite‐valued networks, Asian J. Control16 (2014), 1179-1190. · Zbl 1300.93109
[16] H.Li, Y.Wang, and P.Guo, State feedback based output tracking control of probabilistic boolean networks, Inform Sci.349-350 (2016), 1-11. · Zbl 1398.93124
[17] Y.Wu and T.Shen, Policy iteration algorithm for optimal control of stochastic logical dynamical systems, IEEE Trans. Neural Netw Learn. Syst.29 (2018a), 2031-2036.
[18] Y.Wu et al., Optimal control of Boolean control networks with average cost: A policy iteration approach, Automatica100 (2018), 378-387. · Zbl 1415.93043
[19] Y.Wu and T.Shen, An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems, Syst Control Lett.82 (2015), 108-114. · Zbl 1417.93339
[20] Y.Wu and T.Shen, A finite convergence criterion for the discounted optimal control of stochastic logical networks, IEEE Trans Autom. Control63 (2018b), 262-268. · Zbl 1390.93874
[21] W. K.Ching, X.Chen, and N. K.Tsing, Generating probabilistic boolean networks from a prescribed transition probability matrix, IET Syst Biol.3 (2009), 453-464.
[22] X.Cheng et al., Exact identification of the structure of a probabilistic boolean network from samples, IEEE‐ACM Trans Comput. Biol. Bioinform.13 (2016), 1107-1116.
[23] S. Q.Zhang et al., Generating probabilistic boolean networks from a prescribed stationary distribution, Information Sciences. 180 (2010), 2560-2570. · Zbl 1193.92048
[24] K.Kobayashi and K.Hiraishi, Design of probabilistic boolean networks based on network structure and steady‐state probabilities, IEEE Trans. Neural Netw Learn. Syst.28 (2017), 1966-1971.
[25] Y. W.Wen et al., Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic boolean networks, Numer. Linear Algebr Appl.22 (2015), 883-899. · Zbl 1349.65140
[26] X.Chen, H.Jiang, and W. K.Ching, On construction of sparse probabilistic boolean networks, East Asian J. Appl. Math.2 (2012), 1-18. · Zbl 1284.60141
[27] P.Bremaud, Markov Chains ‐ Gibbs Fields, Monte Carlo Simulation, and Queues, Texts in Applied Mathematics, Springer, New York, 1999. · Zbl 0949.60009
[28] A.Stuart and K.Ord, Kendall’s Advanced Theory of Statistics, Distribution Theory Kendall’s Advanced Theory of Statistics, Wiley, New York, 2009.
[29] B. L.Fox and D. M.Landi, Scientific applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix, Commun. ACM11 (1968), 619-621. · Zbl 0177.45701
[30] M.Chaves, Methods for qualitative analysis of genetic networks, Proc Eur. Control Conf. (ECC), Budapest, Hungary, 2009, pp. 671-676.
[31] K.Kobayashi and K.Hiraishi, An integer programming approach to optimal control problems in context‐sensitive probabilistic boolean networks, Automatica47 (2011), 1260-1264. · Zbl 1235.93260
[32] T.Eissing, M.Chaves, and F.Allgöwer, Live and let – systems biology view on cell death, Comput Chem. Eng.33 (2009), 583-589.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.