logo

SCIENCE CHINA Information Sciences, Volume 61, Issue 12: 129202(2018) https://doi.org/10.1007/s11432-018-9507-7

Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices

More info
  • ReceivedMay 24, 2018
  • AcceptedJun 15, 2018
  • PublishedNov 7, 2018

Abstract

There is no abstract available for this article.


Acknowledgment

This work was supported by National Natural Science Foundation of China (Grant Nos. 61573199, 61573200).


Supplement


References

[1] Pantelic V, Postma S M, Lawford M. Probabilistic supervisory control of probabilistic discrete event systems. IEEE Trans Autom Control, 2009, 54: 2013-2018 CrossRef Google Scholar

[2] Keroglou C, Hadjicostis C N. Verification of detectability in probabilistic finite automata. Automatica, 2017, 86: 192-198 CrossRef Google Scholar

[3] Cheng D Z, Qi H S. A linear representation of dynamics of Boolean networks. IEEE Trans Autom Control, 2010, 55: 2251-2258 CrossRef Google Scholar

[4] Zhao Y, Cheng D Z. On controllability and stabilizability of probabilistic Boolean control networks. Sci China Inf Sci, 2014, 57: 012202 CrossRef Google Scholar

[5] Xu X R, Hong Y G. Matrix expression and reachability analysis of finite automata. J Control Theory Appl, 2012, 10: 210-215 CrossRef Google Scholar

[6] Han X G, Chen Z Q, Liu Z X. The detection and stabilisation of limit cycle for deterministic finite automata. Int J Control, 2018, 91: 874-886 CrossRef Google Scholar

[7] Zhang Z P, Chen Z Q, Han X G. 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 CrossRef Google Scholar

[8] Cassandras C, Lafortune S. Introduction to Discrete Event System. 2nd ed. New York: Springer Science and Business Media, 2008. Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1