Abstract
We address in this paper the problem of detecting faults located in a given component embedded within a composite system. The system is represented as two communicating FSMs, a component FSM inaccessible for testing and a context machine that models the remaining part of the system which is assumed to be correctly implemented. We elaborate a systematic approach for deriving external tests which can detect all predefined types of faults in the embedded component. The approach. is based on the construction a proper characterization of the conforming behavior of the component in context, derivation of internal tests and translation into external tests.
Chapter PDF
Similar content being viewed by others
References
Aziz, A., Balarin, F., Brayton, R. K., DiBenedetto M. D., and Saldanha, A. (1995) Supervisory control of finite state machines, Proceedings of the 7th International Conference CA V’95, pp. 279–292.
Bochmann, G. v. (1978) Finite state descriptions of communication protocols, Computer Networks, 2.
Brand, D., and Zafiropulo, P. (1983) On communicating finite state machines. Journal of ACM, 30, 2, 323–42.
Fernandez, J. C., Jard, C., Jeron, T., and Viko, G. (1996) Using on-the-fly verification techniques for the generation of test suites, Proceedings of the 8th International Conference CAV’96.
Heerink, L. and Brinksma, E. (1995) Validation in context, Proceedings of the 15th IFIP International Symposium on Protocol Specification, Testing, and Verification, Chapman and Hall.
Huang, S., Lee, D., and Staskauskas, M. (1996) Validation-based test sequence generation for networks of extended finite state machines, the Proceedings of the IFIP 1st Joint International Conference FORTE/PSTV, Chapman and Hall, pp. 403–418.
Hoperoft, J. E., and Ullman J. D. (1979) Introduction to automata theory, languages, and computation, Addison-Wesley, New York.
Johnson, D.S. (1974) Approximation algorithms for combinatorial problems. Journal Comput. Syst. Sci., 9, pp. 256–78.
Koppol, P. V., Tai, K. C. (1995) Conformance testing of protocols specified as labeled transition systems, Proceedings of the 8th International Workshop on Protocol Test Systems (IWPTS’95), pp. 143–158.
Luo, G., Bochmann, G. v., and Petrenko, A. (1994) Test selection based on communicating nondeterministic finite state machines using a generalized Wp-method. IEEE Trans. on Soft. Eng., SE-20, 2, 149–62.
Lin, B., de Jong G., and Kolks, T. (1995) Hierarchical optimization of asynchronous circuits, Proceedings of the 32nd DAC, pp. 712–717.
Lee, D., Sabnani, K. K., Kristol, D. M., and Paul S. (1996) Conformance testing of protocols specified as communicating finite state machines - a guided random walk based approach, IEEE Trans. on Communication, vol. 44, 5.
Merlin, P., and Bochmann, G. v. (1983) On the construction of submodule specifications and communication protocols, ACM Trans. on Programming Languages and Systems, Vol. 5, No. 1, pp. 1–25.
Petrenko, A., Bochmann, G. v., and Dssouli, R. (1993) Conformance relations and test derivation, Invited Paper, Proceedings of the 6th International Workshop on Protocol Test Systems (IWPTS’93), pp. 157–178.
Petrenko, A., Yevtushenko, N., Bochmann, G. v., and Dssouli, R. (1996) Testing in context: framework and test derivation, Computer Communications Journal, Special issue on Protocol Engineering, 19, pp. 1236–1249.
Petrenko, A., Yevtushenko, N., and Bochmann, G. v. (1996) Fault models for testing in context, Proceedings of the IFIP 1st Joint International Conference FORTF•PSTV, Chapman and Hall, pp. 163–178.
Petrenko, A., Yevtushenko, N., and Bochmann, G. v. (1996) Testing deterministic implementations from nondeterministic fsm specifications, Proceedings of the 9th IWTCS’96, Chapman and Hall, pp. 125–140.
Petrenko, A., Yevtushenko, N., and Dssouli, R. (1994) Testing strategies for communicating fsms, Proceedings of the 7th IWTCS’94, pp. 193–208.
Petrenko, A., Yevtushenko, N., Lebedev, A., and Das, A. (1993) Nondeterministic state machines in protocol conformance testing, Proceedings of the 6th IWPTS, pp. 363–378.
Qin, H., and Lewis, P. (1991) Factorization of finite state machines under strong and observational equivalencies, Journal of Formal Aspects of Computing, Vol. 3, pp. 284–307.
Star72] Starke, P.H. (1972) Abstract automata. North-Holland/American Elsevier.
Sidhu, D. P., and Leung, T. K. (1989) Formal methods for protocol testing: a detailed study, IEEE Trans. on Soft. Eng., SE-15, 4, pp. 413–426.
West, C. (1986) Protocol validation by random state exploration, Proceedings of the 6th ISPSTV.
Yannakakis, M., and Lee, D. (1995) Testing finite state machines: fault detection, Journal of Computer and System Sciences, 50, pp. 209–227.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Petrenko, A., Yevtushenko, N. (1997). Fault detection in embedded components. In: Kim, M., Kang, S., Hong, K. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35198-8_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35198-8_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6701-8
Online ISBN: 978-0-387-35198-8
eBook Packages: Springer Book Archive