On minimizing the lengths of checking sequences

IEEE Transactions on Computers

Volumn 46, Issue 1, 1997, Pages 93-99

  Ural, Hasan ^a   Wu, Xiaolin ^b   Zhang, Fan ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b NORTEL NETWORKS   (Canada)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Checking experiments; Checking sequences; Fault detection; Finite state machines; Testing

Indexed keywords

ALGORITHMS; ERROR DETECTION; FINITE AUTOMATA; HEURISTIC METHODS; MATHEMATICAL MODELS;

CHECKING SEQUENCES; FINITE STATE MACHINES; STATE RECOGNITION SEQUENCES;

SEQUENTIAL MACHINES;

EID: 0031369478     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.559807     Document Type: Article

References (15)

1. A.V. Aho, A.T. Dahbura, D. Lee, and M.U. Uyar, "An Optimization Technique for Protocol Conformance Tea Sequence Generation Based on UIO Sequences and Rural Chinese Postman Tours," IEEE Trans. Comm., vol. 39, pp. 1,604-1,615, Nov. 1991.
2. J.A. Bondy and U.S.R. Murty, Graph Theory With Applications. New York: Elsevier North Holland, 1976.
3. S.C. Boyd and H. Ural, "On the Complexity of Generating Optimal Test Sequences," IEEE Trans. Software Eng., vol. 17, no. 9, pp. 976-978, Sept. 1991.
4. A.T. Dahbura, K.K. Sabnani, and M.U. Uyar, "Formal Methods for Generating Protocol Conformance Test Sequences," Proc. IEEE, vol. 78, pp. 1,317-1,325, Aug. 1990.
5. J. Edmonds and E.L. Johnson, "Matching, Euler Tours and the Chinese Postman," Mathematical Programming, vol. 5, pp. 88-124, 1973.
6. A. Gill, Introduction to the Theory of Finite-State Machines. New York: McGraw-Hill, 1962.
7. G. Gonenc, "A Method for the Design of Fault Detection Experiments," IEEE Trans. Computers, vol. 19, no. 6, pp. 551-558, June 1970.
8. F.C. Hennie, "Fault Detecting Experiments for Sequential Circuits," Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, pp. 95-110, Princeton, N.J., 1964.
9. M.K. Kuan, "Graphic Programming Using Odd or Even Points," Chinese Math., vol. 1, pp. 273-277, 1962.
10. D. Lee and M. Yannakakis, "Testing Finite State Machines: State Identification and Verification," IEEE Trans. Computers, vol. 43, pp. 306-320, 1994.
11. E.L. Lowler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976.
12. Y.-N. Shen, F. Lombardi, and A.T. Dahbura, "Protocol Conformance Testing Using Multiple UIO Sequences," IEEE Trans. Comm., vol. 40, pp. 1,282-1,287, Aug. 1992.
13. D.P. Sidhu and T.K. Leung, "Formal Methods for Protocol Testing: A Detailed Study," IEEE Trans. Software Eng., vol. 15, pp. 413-426, 1989.
14. M.P. Vasilevskii, "Failure Diagnosis of Automata," Kibernetika, vol. 4, pp. 98-108, 1973.
15. M. Yannakakis and D. Lee, "Testing Finite State Machines: Fault Detection," J. Computer and System Sciences, vol. 50, pp. 209-227, 1995.