Excavating
Patent
1989-06-07
1991-02-05
Smith, Jerry
Excavating
371 151, G06F 1100
Patent
active
049911767
ABSTRACT:
Faster, yet, completely efficient and exhaustive testing is afforded an entity (e.g., protocol, VLSI circuit, software application) represented as finite state machines by employing the present method in which test sequences are generated according to minimum cost function rules. Minimum cost unique signatures are developed for state identification of the finite state machine. Based upon the minimum cost unique signatures, a minimum cost test sequence is generated to cover every state transition of the finite state machine. As a result, every testable aspect of the entity is guaranteed to be tested using a minimum number of steps which represents a considerable cost savings.
REFERENCES:
patent: 4692921 (1987-09-01), Dahbura et al.
patent: 4696006 (1987-09-01), Kawai
patent: 4748626 (1988-05-01), Wong
J. P. Roth, "Improved Test-Generating D-Algorithm", IBMTDB, vol. 20, No. 9, Feb. 1978, pp. 3792-3794.
Dahbura Anton T.
Sabnani Krishan K.
Uyar M. Umit
AT&T Bell Laboratories
Beausoliel Robert W.
Ranieri Gregory C.
Smith Jerry
LandOfFree
Optimal test generation for finite state machine models does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Optimal test generation for finite state machine models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal test generation for finite state machine models will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-17496