Detectability in stochastic discrete event systems
From MaRDI portal
Publication:897674
DOI10.1016/j.sysconle.2015.07.005zbMath1326.93084OpenAlexW1141352453MaRDI QIDQ897674
Christoforos Keroglou, Christoforos N. Hadjicostis
Publication date: 7 December 2015
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.07.005
Estimation and detection in stochastic control theory (93E10) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03)
Related Items
\(k\)-memory-embedded insertion mechanism for opacity enforcement, Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection, Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures, On detectability of Boolean control networks, Verification of detectability in probabilistic finite automata, On detectability of labeled Petri nets and finite automata, Probabilistic verification of diagnosability for a certain class of timed stochastic systems, Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems, Trajectory detectability of discrete-event systems, Analysis of strong and strong periodic detectability of bounded labeled Petri nets, Stabilization of probabilistic finite automata based on semi-tensor product of matrices
Uses Software
Cites Work
- Unnamed Item
- On NFAs where all states are final, initial, or both
- On observability of discrete-event systems
- State estimation and detectability of probabilistic discrete event systems
- Observability of discrete event dynamic systems
- Markov Chains
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Diagnosability of discrete-event systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Diagnosability of stochastic discrete-event systems
- Detectability of Discrete Event Systems
- Verification of Infinite-Step Opacity and Complexity Considerations