Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Analysis of Faults in Cyber-Physical Systems by Finite Discrete-Time Markov Chains
Authors: Volodymyr G. Skobelev, Volodymyr V. Skobelev
Keywords: Cyber-Physical Systems, faults, Discrete-Time Markov Chains, bounded probabilistic reachability, probabilistic counterexamples.
– 0.13 Mb
Keywords: Cyber-Physical Systems, faults, Discrete-Time Markov Chains, bounded probabilistic reachability, probabilistic counterexamples.
Abstract
In the given paper the problem of Cyber-Physical Systems behavior analysis in the occurrence of faults is investigated. To present the fault-free behavior of the investigated Cyber-Physical System as well as its behaviors in the presence of admissible faults, some Finite Discrete-Time Markov Chain is proposed and analyzed. It is shown that a single stationary probability distribution exists for the proposed model. This distribution is applied for characterization the behaviors of the investigated Cyber-Physical System in terms of the distance from the current fault to the set of critical faults. Besides, the algorithm for bounded probabilistic reachability analysis of the target set of faults is proposed.Volodymyr G. Skobelev
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 063 431 86 05
E-mail:
Volodymyr V. Skobelev
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 066 276 85 72
E-mail:
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 063 431 86 05
E-mail:
Volodymyr V. Skobelev
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 066 276 85 72
E-mail:
Fulltext
– 0.13 Mb
Contents
- Semi-automated workflow for recognition of printed documents with heterogeneous content
- On Alignment of Textual Elements in a Parallel Diachronic Corpus
- On one type of stability for multiobjective integer linear programming problem with parameterized optimality
- Analysis of Faults in Cyber-Physical Systems by Finite Discrete-Time Markov Chains
- Loser-out multi metaheuristic framework for multi-objective optimization
- On groupoids with Bol-Moufang type identities
- Digital signature scheme set in a hidden cyclic group
- Investigation of Some Cryptographic Properties of the 8x8 S-boxes Created by Quasigroups
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
