Skip to main content
SpringerLink
Log in

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

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

    Article  MathSciNet  Google Scholar 

  2. Keroglou C, Hadjicostis C N. Verification of detectability in probabilistic finite automata. Automatica, 2017, 86: 192–198

    Article  MathSciNet  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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  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

    Article  MathSciNet  Google Scholar 

  6. 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

    Article  MathSciNet  Google Scholar 

  7. 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

    MATH  Google Scholar 

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

    Book  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. College of Computer and Control Engineering, Nankai University, Tianjin, 300350, China

    Zhipeng Zhang, Zengqiang Chen & Zhongxin Liu

  2. Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin, 300350, China

    Zhipeng Zhang, Zengqiang Chen & Zhongxin Liu

Authors
  1. Zhipeng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zengqiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhongxin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zengqiang Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-018-9507-7

Search

Navigation