Semitensor Product Approach to Controllability, Reachability, and Stabilizability of Probabilistic Finite Automata

This paper proposes a matrix-based approach to investigate the controllability, reachability, and stabilizability of probabilistic finite automata (PFA). Firstly, the state transition probabilistic structure matrix is constructed for PFA, based on which a kind of controllability matrix is defined for PFA. Secondly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of PFA with positive probability by using the controllability matrix. Finally, an illustrate example is given to validate the obtained new results.

[1]  Gang Feng,et al.  Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters , 2017, IEEE Transactions on Automatic Control.

[2]  Carlo Mereghetti,et al.  Converting two-way nondeterministic unary automata into simpler automata , 2003, Theor. Comput. Sci..

[3]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[4]  Yansheng Liu,et al.  Stabilization and set stabilization of delayed Boolean control networks based on trajectory stabilization , 2017, J. Frankl. Inst..

[5]  Zhongxin Liu,et al.  Semi-tensor product approach to controllability and stabilizability of finite automata , 2015 .

[6]  Daizhan Cheng,et al.  From STP to game-based control , 2017, Science China Information Sciences.

[7]  Francisco Casacuberta,et al.  Probabilistic finite-state machines - part II , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Tingwen Huang,et al.  Controllability and Synchronization Analysis of Identical-Hierarchy Mixed-Valued Logical Control Networks , 2017, IEEE Transactions on Cybernetics.

[9]  Manuel Silva Suárez,et al.  On Observability and Design of Observers inTimed Continuous Petri Net Systems , 2008, IEEE Transactions on Automation Science and Engineering.

[10]  Feng Lin,et al.  State estimation and detectability of probabilistic discrete event systems , 2008, Autom..

[11]  L. Recalde,et al.  On Controllability of Timed Continuous Petri Net Systems: the Join Free Case , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Francisco Casacuberta,et al.  Probabilistic finite-state machines - part I , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Yiguang Hong,et al.  Matrix expression and reachability analysis of finite automata , 2012 .

[14]  Pan Wang,et al.  Set stability and set stabilization of Boolean control networks based on invariant subsets , 2015, Autom..

[15]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[16]  Zhipeng Zhang,et al.  Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices , 2018, Science China Information Sciences.

[17]  Yuzhen Wang,et al.  Further results on feedback stabilization control design of Boolean control networks , 2017, Autom..

[18]  Weiwei Sun,et al.  Event-triggered control for robust set stabilization of logical control networks , 2018, Autom..

[19]  Tielong Shen,et al.  Logical control scheme with real-time statistical learning for residual gas fraction in IC engines , 2017, Science China Information Sciences.

[20]  Yang Liu,et al.  Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems , 2017 .

[21]  Asok Ray,et al.  Vector space formulation of probabilistic finite state automata , 2012, J. Comput. Syst. Sci..

[22]  Christoforos Keroglou,et al.  Verification of detectability in Probabilistic Finite Automata , 2017, Autom..

[23]  Yonghua Li,et al.  Supervisory control of probabilistic discrete-event systems with recovery , 1999, IEEE Trans. Autom. Control..

[24]  Yiguang Hong,et al.  Matrix Approach to Model Matching of Asynchronous Sequential Machines , 2013, IEEE Transactions on Automatic Control.

[25]  Fangfei Li,et al.  On stabilization and set stabilization of multivalued logical systems , 2017, Autom..

[26]  Jean-Charles Delvenne,et al.  Complexity of control on finite automata , 2006, IEEE Transactions on Automatic Control.

[27]  D. Cheng,et al.  An Introduction to Semi-Tensor Product of Matrices and Its Applications , 2012 .

[28]  Yuzhen Wang,et al.  Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks , 2017, SIAM J. Control. Optim..

[29]  Jiandong Zhu,et al.  Kalman decomposition for Boolean control networks , 2015, Autom..

[30]  John Lygeros,et al.  Controllers for reachability specifications for hybrid systems , 1999, Autom..

[31]  Jitao Sun,et al.  Stabilization, Controllability and Optimal Control of Boolean Networks With Impulsive Effects and State Constraints , 2015, IEEE Transactions on Automatic Control.

[32]  Zengqiang Chen,et al.  Modeling, Reachability and Controllability of Bounded Petri Nets Based on Semi‐Tensor Product of Matrices , 2020 .