Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
Formal languages and automata (68Q45) Controllability (93B05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete event control/observation systems (93C65) Stabilization of systems by feedback (93D15) Stochastic systems in control theory (general) (93E03)
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.
- Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
- Controllability, reachability, and stabilizability of finite automata: a controllability matrix method
- Controllability of probabilistic Boolean control networks
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
- An introduction to semi-tensor product of matrices and its applications
- Complexity of Control on Finite Automata
- Controllers for reachability specifications for hybrid systems
- Converting two-way nondeterministic unary automata into simpler automata.
- Further results on feedback stabilization control design of Boolean control networks
- scientific article; zbMATH DE number 1383199 (Why is no real title available?)
- scientific article; zbMATH DE number 781092 (Why is no real title available?)
- Kalman decomposition for Boolean control networks
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Matrix Approach to Model Matching of Asynchronous Sequential Machines
- On stabilization and set stabilization of multivalued logical systems
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters
- Stabilization and set stabilization of delayed Boolean control networks based on trajectory stabilization
- Stabilization, Controllability and Optimal Control of Boolean Networks With Impulsive Effects and State Constraints
- State estimation and detectability of probabilistic discrete event systems
- STP-based judgment method of reversibility and liveness of bounded Petri nets
- Supervisory control of probabilistic discrete-event systems with recovery
- Vector space formulation of probabilistic finite state automata
- Verification of detectability in probabilistic finite automata
- Controllability, reachability, and stabilizability of finite automata: a controllability matrix method
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
- Matrix expression of Shapley value in graphical cooperative games
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
This page was built for publication: Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298809)
