Synthetic interferograms generation through Okada formulation, considering a set of fault parameters spanning the variations of the phenomena behavior.
We compared a set of fault plane solutions determined both with FPFIT and Horiuchi et al. (1995) methods in Fig. 5.
For a set of fault rapture with reverse and strike-slip mechanism, eleven ground motions within 25 50 km are considered at magnitude range of 6.2 7.4.
We propose to design a set of fault detection filters, or residual generation systems, corresponding to each of the fault components, to guarantee that each subsystem is mean square stable and satisfies a prescribed disturbance attenuation level.
A set of fault scenarios, including single and multiple point- defects as well as generalized roughness conditions, are designed and tested under different operational conditions, including different motor speeds, different load conditions and samples from different operating time intervals.
For each component, they determined the flaws and built a failure propagation model (as a set of fault trees), which relates failures at the ports of the components with internal errors.
The surviving route graph R G ,ρ / For a graph G, a routing ρ and a set oforaults F is a directed graph consistinG of nonfaulty nodes of G with a diroutingedge from a node x to a node y iff there are no faults on the route from x to y.
The developed model is analysed by means of Structural Analysis, to identify the correlations among involved physical variables, defined equations and a set of faults which may occur in the system (related to both auxiliary components malfunctions and stack degradation phenomena).
(1) A system S is fault tolerant with respect to algorithm A and fault F if A is executable by SF. (2) S is fault tolerant with respect to a set of algorithms { A 1, A 2, A 3, …, A p } and a set of faults { F 1, F 2, …, F q } if A i is executable by S F j for all i and j, where 1 ≤ i ≤ p. .
A system S is fault tolerant with respect to algorithm A and fault F if A is executable by SF. S is fault tolerant with respect to a set of algorithms { A 1, A 2, A 3, …, A p } and a set of faults { F 1, F 2, …, F q } if A i is executable by S F j for all i and j, where 1 ≤ i ≤ p. If S is k-fault tolerant with respect to A, then S is j-fault tolerant with respect to A for all j, where 0 ≤ j ≤ k.
The user can select the fault to simulate among a set of possible faults (fault in controllers, sensors, pumps, etc)., and can specify the activation time (at which the fault starts), the development time (time elapsed from the fault start up until the fault reaches its maximum magnitude) and the fault magnitude.
