• Aucun résultat trouvé

Accurate approximate diagnosability of stochastic systems

N/A
N/A
Protected

Academic year: 2021

Partager "Accurate approximate diagnosability of stochastic systems"

Copied!
24
0
0

Texte intégral

Loading

Figure

Fig. 2. An uniformly AA-diagnosable pLTS A 2 , that is not A-diagnosable.
Fig. 4. From probabilistic automata to pLTS.
Fig. 5. Illustration of the proof of Lemma D.
Fig. 6. From probabilistic automata to pLTS: rectangles surround the two copies of Q.

Références

Documents relatifs

As for first-order push- down systems, checking bounded latency amounts to checking finiteness of a higher-order pushdown language.. For arbitrary higher-order push- down language,

Definition – Local diagnosis effort for a flow ( δ eff): The global diagnosis effort for a flow F is the probable effort needed for pointing out the faulty statement, knowing that

CHECKING DIAGNOSABILITY ON CENTRALIZED MODEL OF THE SYSTEM The proposed approach is based on previous work on the diagnosability [11], it aims to avoid the construction of

These approaches can also be distinguished by the way the system is modeled (in normal and/or abnormal operation) as well as the modelling tool used (Petri Net, Bayesian

Even in the case of stochastic systems, the different notions of diagnosability have examined whether a fault detector would trigger for sure or not, either in finite time.. Fabre

Ignoring the dashed transitions at the bottom, the automaton is T-diagnosable as after the obser- vation of sequence a a fault occurred in both runs at the top, and this fault is

Abstract: In a discrete event stochastic system, the natural notion of diagnosability, called A- diagnosability, requires that each fault event is eventually detected with

A key idea of this paper is to abstract the evolution of a set of continuous quantities relevant for diagnosis, namely mode signatures, in terms of events so that diagnosis