By Topic

Multiple fault diagnostics for communicating nondeterministic finite state machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Belhassine-Cherif, R. ; SYSCOM, Tunis, Tunisia ; Ghedamsi, A.

During the last decade, different methods were developed to produce optimized test sequences for detecting faults in, communication protocol implementations. However, the application of these methods gives only limited information about the location of detected faults. We propose a complementary step, which localizes the faults, once detected. It consists of a generalized diagnostic algorithm for the case where more than one fault may be present in the transitions of a system represented by communicating nondeterministic finite state machines, if existing faults are detected, this algorithm permits the generation of a minimal set of diagnoses, each of which is formed by a set of transitions suspected of being faulty. A simple example is used to demonstrate the functioning of the proposed diagnostic algorithm. The complexity of each step in the algorithm are calculated

Published in:

Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on

Date of Conference:

2001