Verification of detectability in probabilistic finite automata
DOI10.1016/J.AUTOMATICA.2017.08.027zbMATH Open1375.93118OpenAlexW2756653445MaRDI QIDQ1678629FDOQ1678629
Authors: Christoforos Keroglou, Christoforos N. Hadjicostis 
Publication date: 17 November 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.08.027
Recommendations
- Detectability in stochastic discrete event systems
- State estimation and detectability of probabilistic discrete event systems
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
- Detectability verification of probabilistic Boolean networks
- Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Cellular automata (computational aspects) (68Q80) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03) Estimation and detection in stochastic control theory (93E10)
Cites Work
- Introduction to algorithms.
- Large deviations techniques and applications.
- Non-negative matrices and Markov chains.
- Markov Chains
- Diagnosability of discrete-event systems
- Diagnosability of stochastic discrete-event systems
- Observability of discrete event dynamic systems
- On observability of discrete-event systems
- Verification of Infinite-Step Opacity and Complexity Considerations
- Detectability of Discrete Event Systems
- Detectability of discrete event systems with dynamic event observation
- Detectability in stochastic discrete event systems
- State estimation and detectability of probabilistic discrete event systems
- Accurate approximate diagnosability of stochastic systems
- Distinguishing hidden Markov chains
Cited In (17)
- Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
- Deciding detectability for labeled Petri nets
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets
- Probabilistic verification of diagnosability for a certain class of timed stochastic systems
- Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
- An improved approach for verifying delayed detectability of discrete-event systems
- Detectability verification of probabilistic Boolean networks
- State estimation and detectability of probabilistic discrete event systems
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- Detectability of labeled weighted automata over monoids
- Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
- Title not available (Why is that?)
- State estimation of max-plus automata with unobservable events
- On the verification of detectability for timed discrete event systems
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
Uses Software
This page was built for publication: Verification of detectability in probabilistic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678629)
