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

Abstract EN

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.