Verification of detectability in probabilistic finite automata

DOI10.1016/J.AUTOMATICA.2017.08.027MaRDI QIDQ1678629zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Markov modelsfinite automatastate estimationdiscrete event systems

Mathematics Subject Classification ID

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)

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

Cites work

• Accurate approximate diagnosability of stochastic systems
• Detectability in stochastic discrete event systems
• Detectability of Discrete Event Systems
• Detectability of discrete event systems with dynamic event observation
• Diagnosability of discrete-event systems
• Diagnosability of stochastic discrete-event systems
• Distinguishing hidden Markov chains
• Introduction to algorithms.
• Large deviations techniques and applications.
• Markov Chains
• Non-negative matrices and Markov chains.
• Observability of discrete event dynamic systems
• On observability of discrete-event systems
• State estimation and detectability of probabilistic discrete event systems
• Verification of Infinite-Step Opacity and Complexity Considerations

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
• An improved approach for verifying delayed detectability of discrete-event systems
• Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
• 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
• State estimation of max-plus automata with unobservable events
• Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
• scientific article; zbMATH DE number 1564050 (Why is no real title available?)
• On the verification of detectability for timed discrete event systems
• Infinite-step opacity and K-step opacity of stochastic discrete-event systems

Describes a project that uses

Uses Software

• UMDES

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)