Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata (Q2298809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata |
scientific article; zbMATH DE number 7171290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata |
scientific article; zbMATH DE number 7171290 |
Statements
Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata (English)
0 references
20 February 2020
0 references
Summary: 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.
0 references
0 references
0 references
