Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
From MaRDI portal
Publication:2298809
DOI10.1155/2019/8021750zbMath1435.93157WikidataQ128038193 ScholiaQ128038193MaRDI QIDQ2298809
Wenhui Dou, Haitao Li, Fuad Eid S. Alsaadi
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/8021750
93B05: Controllability
93D15: Stabilization of systems by feedback
68Q45: Formal languages and automata
93C65: Discrete event control/observation systems
93E03: Stochastic systems in control theory (general)
93C30: Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)
Related Items
Uses Software
Cites Work
- Vector space formulation of probabilistic finite state automata
- Kalman decomposition for Boolean control networks
- Stabilization and set stabilization of delayed Boolean control networks based on trajectory stabilization
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Controllers for reachability specifications for hybrid systems
- Converting two-way nondeterministic unary automata into simpler automata.
- Verification of detectability in probabilistic finite automata
- Further results on feedback stabilization control design of Boolean control networks
- On stabilization and set stabilization of multivalued logical systems
- State estimation and detectability of probabilistic discrete event systems
- Stabilization, Controllability and Optimal Control of Boolean Networks With Impulsive Effects and State Constraints
- Supervisory control of probabilistic discrete-event systems with recovery
- Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters
- Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks
- Complexity of Control on Finite Automata
- Matrix Approach to Model Matching of Asynchronous Sequential Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item