Probabilistic approaches to fault detection in networked discrete event systems
Hadjicostis, Christoforos N.
SourceIEEE Transactions on Neural Networks
Google Scholar check
MetadataShow full item record
In this paper, we consider distributed systems that can be modeled as finite state machines with known behavior under fault-free conditions, and we study the detection of a general class of faults that manifest themselves as permanent changes in the next-state transition functionality of the system. This scenario could arise in a variety of situations encountered in communication networks, including faults occurred due to design or implementation errors during the execution of communication protocols. In our approach, fault diagnosis is performed by an external observer/diagnoser that functions as a finite state machine and which has access to the input sequence applied to the system but has only limited access to the system state or output. In particular, we assume that the observer/diagnoser is only able to obtain partial information regarding the state of the given system at intermittent time intervals that are determined by certain synchronizing conditions between the system and the observer/diagnoser. By adopting a probabilistic framework, we analyze ways to optimally choose these synchronizing conditions and develop adaptive strategies that achieve a low probability of aliasing, i.e., a low probability that the external observer/diagnoser incorrectly declares the system as fault-free. An application of these ideas in the context of protocol testing/classification is provided as an example. © 2005 IEEE.
Showing items related by title, author, creator and subject.
Papadopoulos, George Angelos; Arbab, Farhad (IEEE, 1996)This paper combines work done in the areas of asynchronous timed computations and coordination models in order to derive a framework able to express real-time coordination without adhering to special architectures or ...
Samaras, George S. (Institute of Electrical and Electronics Engineers Inc., 2002)Mobile computing is distributed computing that involves elements whose location changes in the course of computation. Elements may be software components such as mobile agents or moving objects-data or hardware such as ...
Pitoura, Evaggelia 1967-; Abiteboul, S.; Pfoser, D.; Samaras, George S.; Vazirgiannis, M. (2003)The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a super-database. Our goal is to develop a data management system ...