A technique to generate feasible tests for communications systems with multiple timers

  • Authors:
  • Mariusz A. Fecko;M. Ümit Uyar;Ali Y. Duale;Paul D. Amer

  • Affiliations:
  • Applied Research, Telcordia Technologies, Inc., Morristown, NJ;Department of Electrical Engineering, City College and Graduate Center, City University of New York, New York, NY;Systems Architecture Compliance, IBM, Poughkeepsie, NY;Department of Computer and Information Sciences, University of Delaware, Newark, DE

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new model for testing real-time protocols with multiple timers, which captures complex timing dependencies by using simple linear expressions involving timer-related variables. This new modeling technique, combined with the algorithms to eliminate inconsistencies, allows generation of feasible test sequences without compromising their fault coverage. The model is specifically designed for testing to avoid performing full reachability analysis, and to control the growth of the number of test scenarios. Based on extended finite state machines, it is applicable to languages such as SDL, VHDL, and Estelle. The technique models a realistic testing framework in which each I/O exchange takes a certain time to realize and timers can be arbitrarily started or stopped. A software tool implementing this technique is used to generate test cases for the U.S. Army wireless standard MIL-STD 188-220.