Abstract
This paper provides a framework for approaching the problem of fault detection in large Communication Networks. Communication process are modeled as Discrete Event Systems (D.E.S.), so any fault will appear as a change of a D.E.S. Here we concentrate on the simplest case of Discrete Event systems, namely Finite State Machines (FSM).
The model of computation consists of two FSMs. One, called the observer, observes part of the behavior of the other. Two fundamental questions are formulated.
(a) Given a specific fault that could happen in one FSM, can the observer detect this fault even though it observes only part of the behavior of the FSM?
(b) Given a specific fault that may happen in a FSM, can we design the Minimum Alphabet Observer, i.e., an observer which observes the minimum number of event transitions and is still able to detect this specific fault?
After these questions are introduced we answer them for one specific class of faults. This is the class of faults which can be described as strings. In this case we prove that the first question can be answered in polynomial time while the second is NP-complete. For the second question a heuristic algorithm is given.
This work was carried out under the support of NSF grant #CDR-88-11111, as well as the New York Science and Technology Foundation, through its grant to the Columbia University Center for Advanced Technology.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, Hopcroft and Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley, 1974.
Cieslak R., Desclaux C., Fawaz A., Varaiya P. “Supervisory Control of Discrete Event Processes with Partial Observations”, Memorandum No. UCB/ERL M86 /63, August 1986.
M.R. Garey, D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, W.H. Freeman and Co., New York, 1978.
J.E. Hopcroft, J.D. Ullman, “Introduction to Automata Theory, Languages and Computation”, Addison-Wesley, 1979.
Lam S. S., Shankar U. “Protocol Verification via Projections”, IEEE Transactions on Software Engineering vol SE-10, No 4, July 1984.
Merlin P. M., Farber D. “Recoverability of Communication Protocols-Implications of a Theoretical Study”, IEEE Transactions on Communication, September 1976.
Ramadge P. J. “Observability of Discrete Event Systems” Proceedings of 25th Conference on Decision and Control, Athens, Greece, December 1986.
Tsitsiklis J. N., “On the Control of Discrete Event Dynamical Systems”, MIT LIDS- P-1661.
Wonham W. M., Ramadge P. J., “On the Supremal Controllable Sublanguage of a given Language”, Siam J. Control and Optimization, vol. 25, No 3, May 1987.
The Institute of Electrical and Electronics Engineers, Logical Link Control American National Standards Institute, ANSI/IEEE Std. 802. 2 - 1985.
A. Bouloutas, Issues of Fault Management in Communication Networks, Ph.D. Dissertation, under preparation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Plenum Press, New York
About this chapter
Cite this chapter
Bouloutas, A., Hart, G., Schwartz, M. (1990). On the Design of Observers for Fault Detection in Communication Networks. In: Kershenbaum, A., Malek, M., Wall, M. (eds) Network Management and Control. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1471-4_25
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1471-4_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8779-7
Online ISBN: 978-1-4613-1471-4
eBook Packages: Springer Book Archive