In this work, a general formulation for fault detection in stochastic continuoustime dynamical systems is presented. This formulation is based on the definition of a pre-Hilbert space so that orthogonal projection techniques, based on the statistics of the involved stochastic processes can be applied. The general setting gathers different existing schemes within a unifying framework.

Resilience of the most important properties of stochastic and regular (deterministic) small-world interconnection networks is studied. It is shown that in the broad range of values of the fraction of faulty nodes the networks under consideration possess high fault tolerance, the deterministic networks being slightly better than the stochastic ones.

This paper focuses on the finite time fault tolerant state estimation of Markovian jumping neural networks with two delay components. Firstly, mathematical expression estimator is defined when system components have faults and output has external disturbances. Then, an augmented Lyapunov-Krasovslii functional including additive information, information activation function used to derive stochas...

We propose a StochAstic Fault diagnosis AlgoRIthm, called Safari, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS85 suites of benchmark combinatorial circuits, that Safari achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA∗ and HA∗, for multiple-fault diagno...

A formal analysis of the fault diagnosis capabilities of various FSM-based test sequence selection methods has been carried out’. It is shown’ that the Wp-method’ has the best faultresolution capability among all the known test sequence selection methods based on the FSM model when the implementation has at most one faulty transition. In this paper, we present a test sequence selection method w...

We have created a logic-based Turing-complete language for stochastic modeling. Since the inference scheme for this language is based on a variant of Pearl’s loopy belief propagation algorithm, we call it Loopy Logic. Traditional Bayesian Networks have limited expressive power, basically constrained to finite domains as in the propositional calculus. This language contains variables that can ca...

In a recent paper Helpman, Melitz and Yeaple (2002) argue firm heterogeneity leads to self-selection in the structure of international commerce. Only the most productive firms find it profitable to meet the higher costs associated with FDI; the next set of firms find it profitable to serve foreign markets through exporting; while the least productive firms find it profitable to serve only domes...

This paper tests some of the predictions of recent advances in trade theory that have focused on different trade patterns of firms within the same sector. Helpman, Melitz and Yeaple (2005) develop a model in which innate productivity differences between firms determine the degree of international engagement of firms: The least productive firms produce for the domestic market, better performers ...