This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Pantelic V, Postma S M, Lawford M. Probabilistic supervisory control of probabilistic discrete event systems. IEEE Trans Autom Control, 2009, 54: 2013–2018
Keroglou C, Hadjicostis C N. Verification of detectability in probabilistic finite automata. Automatica, 2017, 86: 192–198
Cheng D Z, Qi H S. A linear representation of dynamics of Boolean networks. IEEE Trans Autom Control, 2010, 55: 2251–2258
Zhao Y, Cheng D Z. On controllability and stabilizability of probabilistic Boolean control networks. Sci China Inf Sci, 2014, 57: 012202
Xu X R, Hong Y G. Matrix expression and reachability analysis of finite automata. J Control Theory Appl, 2012, 10: 210–215
Han X G, Chen Z Q, Liu Z X, et al. The detection and stabilisation of limit cycle for deterministic finite automata. Int J Control, 2018, 91: 874–886
Zhang Z P, Chen Z Q, Han X G, et al. On the static output feedback stabilization of deterministic finite automata based upon the approach of semi-tensor product of matrix. Kybernetika, 2018, 1: 41–60
Cassandras C, Lafortune S. Introduction to Discrete Event System. 2nd ed. New York: Springer Science and Business Media, 2008
This work was supported by National Natural Science Foundation of China (Grant Nos. 61573199, 61573200).
About this article
Cite this article
Zhang, Z., Chen, Z. & Liu, Z. Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices. Sci. China Inf. Sci. 61, 129202 (2018). https://doi.org/10.1007/s11432-018-9507-7