Principles and methods of testing finite state machines - A survey

Proceedings of the IEEE

Volumn 84, Issue 8, 1996, Pages 1090-1123

  Lee, David ^a   Yannakakis, Mihalis ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER HARDWARE; COMPUTER SIMULATION; COMPUTER SOFTWARE; ERROR DETECTION; FINITE AUTOMATA; NETWORK PROTOCOLS; PROGRAM DEBUGGING; RELIABILITY; SEQUENTIAL CIRCUITS; SYSTEMS ANALYSIS;

FINITE STATE MACHINES; STATE TRANSITIONS;

COMPUTER TESTING;

EID: 0030212784     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.533956     Document Type: Article

References (154)

1. V. D. Agrawal and S. C. Seth, Test Generation for VLSI Chips. New York: Computer Soc. Press, 1988.
2. A. V. Aho, A. T. Dahbura, D. Lee, and M. U. L'yar, "An optimization technique for protocol confonnance test generation based on UIO sequences and rural Chinese postman tours," IEEE Trans. Commun., vol 39, pp. 1604-1615, N'ov. 1991.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: AddisonWesley, 1974.
4. A. V. Aho and D. Lee, "Efficient algorithms for constructing testing sets, covering paths, and minimum flows," AT&T Bell Labs Tech. Memo. CSTR159, 1987.
5. A. V. Aho. R. Sethi, and j. D. Ullman, Compilers: Principles, Techniques, and Tools. Reading. MA: Addison-Wesley, 1986.
6. R. Aleliunas et ai., "Random walks, universal traversal sequences, and the complexity of maze problems," in Proc. 20th Anna. Symp. on Foundations of Computer Sei., 1979, pp. 218-223.
7. N. P. Alfano and B. Kanungo, "Development of an international standard for conformance testing X.25 DTE's," in Proc. It'IP WG6.1 10th Int. Symp. on Protocol Specification, Testing, and Verification, L. Logrippo, R. L. Probert, and H. Ural, Eds. Amsterdam: North-Holland, I990, pp. 129-140.
8. R. Alur, C. Courcoubctis, and D. Dill, "Model checking for reaitimed systems," in Proc. 5th IEEE Sytnp. on Logic in Computer Sei., 1990, pp. 414-425.
9. R. Alur, C. Courcoubeus, and M. Yannakakis, "Distinguishing tests for nondeterministic and probabilistic machines," in Proc. 27th Anna. ACM Svtnp. on Theory of Computing, 1995, pp. 363-372.
10. D. Angluin, "Learning regular sets from queries and counterexamples," Inform, and Computation, vol. 75, pp. 87-106, 1987.
11. __, "Computational learning theory: survey and selected bibliography," in Proc. 24th Anna. ACM Symp. on Theory of Contouring, 1992, pp. 351-369.
12. Int. Standard ISO 8802-2, ANSI/IEEE sid 802.2, 1989.
13. Int. Standard 1SO/IEC 8802-5, ANSI/IEEE sid 802.5, 1992.
14. B. Austermuehl, "MHTS/400-testing message handling systems," in Proc. IF IP WG6.1 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann, Eds. Amsterdam: Xcrth-Hollaad, 1986, pp. 151-162.
15. U. Bar, M. Strecker, W. Stoil, and W. EtTelsberg, "Presentation layer contbrmance testing with TTCN," in Proc. 1F1P WG6.1 llth Int. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pehrson, Eds. Amsterdam: North-Holland, pp. 283-298. 1991.
16. U. Bar and J. M. Schneider, "Automated validation of TTCN test suites," in Proc. If IP WG6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 279-295.
17. G. v. Bochmann and C. A. Sunshine, "A survey of formal methods," in Computer Networks and Protocols, P. E. Green, Ed. New York: Pienum, 1983, pp. 561-578.
18. S. C. Boyd and H. Ural, "On the complexity of generating optimal test sequences," IEEE Trans. Software Eng., vol. 17, pp. 976-978, Sept. 1991.
19. D. Brand and P. Zafiropulo, "On communicating finite-state machines," JACM, vol. 30, no. 2, pp. 323-342, 1983.
20. M. A. Breuer, "An algorithm for generating a fault detection test for a class of sequential circuits," in Theory of Machines and Computations, Z. Kohavi and A. Paz, Eds. New York: Academic, 1972, pp. 313-326.
21. E. Brinksma, "A theory for the derivation of tests," in Proc. IFIP WG6.1 8th Int. Symp. on Protocol Specification, Testing, and Verification, S. Aggarwal and K. Sabnani, Eds. Amsterdam: North-Holland, 1988, pp. 63-74.
22. E. Brinksma, J. Tretmans, and L. Vcrhaard, "A framework for test selection," in Proc. IFIP WG6.1 11th Int. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pehrson, Eds. Amsterdam: North-Holland, 1991, pp. 233-248.
23. S. P. van de Burgt, J. Kroon, and A. M. Peelers, "Testability of formal specifications," in Proc. IFIP WG6.1 12th Im. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 63-77.
24. R. Castanet and R. Sijelmassi, "Methods and semi-automatic tools for preparing distributed testing," in Proc. IFIP WG6.1 6th Intl. Symp. on Protocol Specification, Testing, and Verification, B. Sankaya and G. v. Bochmann, Eds. Amsterdam: North-Holland, 1986, pp. 177-188.
25. U. Celikkan and R. Cleaveland, "Computing diagnostic tests for incorrect processes," in Proc. IFIP WG6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr., and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 263-278.
26. W. Y. L. Chan, S. T. Vuong, and M. R. Ito, "An improved protocol test generation procedure based on UIO's," in Proc. SIGCOM, pp. 283-294, 1989.
27. __, "On test sequence generation for protocols," in Proc. IFIP WG6.1 9th Inf. Symp. on Protocol Specification, Testing, and Verification, E. Brinksma, G. Scolio, and C. A. Vissers, Eds. Amsterdam: North-Holland, 1989, pp. 119-130.
28. S. T. Chanson, B. P. Lee, N. J. Parakh, and H. X. Zeng, "Design and implementation of a ferry clip test systems," in Proc. IFIP
29. WC6.J 9th Int. Symp. on Protocol Specification, Testing, and Verification, E. Brinksma, G. Scollo, and C. A. Vissers, Eds. Amsterdam: North-Holland, 1989, pp. 101-118.
30. S. T. Chanson and J. Zhu, "A unified approach to protocol test sequence generation," in Proc. iNFOCOM, 1993, pp. 106-114.
31. M.-S. Chen, Y. Choi, and A. Kershenbaum, "Approaches utilizing segment overlap to minimize test sequences," in Proc. IP IP \VG6.1 10th Int. Symp. on Protocol Specification, Testing, and Verification, L. Logrippo, R. L. Probert, and H. Ural, Eds. Amsterdam: North-Holland, 1990, pp. 85-98.
32. W. H. Chen, C. S. Lu, H. R. Brozovsky, and J. T. Wang, "An optimization technique for protocol conformance testing using multiple UIO sequences, Inform. Process. Lett., vol. 26, pp. 7-11, 1990.
33. W. H. Chen, C. S. Lu, L. Chen, and J. T. Wang, "Synchronizable protocol test generation via the duplex technique," Proc. INFOCOM, pp. 561-563, 1991.
34. W.-H. Chen, C. Y. Tang, and H. Ural, "Minimum-cost synchroni/able test sequence generation via the duplex U Digraph," P rue. INFOCOM, pp. 128-136, 1993.
35. K.-T. Cheng and A. S. Krishnakumar, "Automatic functional test generation using the extended finite state machine model," Proc. DAC, pp. 1-6, 1993.
36. T.-Y. Cheung, Y. Wu, and X. Ye, "Generating test sequences and their degrees of indeterminism for protocols," in Proc. IF1P WC6.1 llth Int. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Farrow, and B. Pehrson, Ed. Amsterdam: North-Holland, 1991, pp. 301-316.
37. T. S. Chow, "Testing software design modeled by finite-state machines,'' IEEE Trans. Software Eng., vol. SE-4, no. 3, pp. 178-187, 1978.
38. W. Chun and P. D. Amer, "Improvements on UIO sequence generation and partial UIO sequences," in Proc. IF IP WG6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Uyar Eds. Amsterdam: North-Holland, 1992, pp. 245-260.
39. __, "Test case generation for protocols specified in Estelle," in Proc. 3rd Int. Conf. on Formal Description Techniques, pp. 197-210, 1990.
40. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction 10 Algorithms. New York: McGraw-Hill, 1989.
41. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
42. A. T. Dahbura, K. Sabnani, and M. U. Uyar, "Formal methods for generating protocol conformance test sequences," Proc IEEE, vol. 78, Aug. 1990.
43. C. Derman, Finite State Markov Decision Processes. New York: Academic, 1972.
44. R. Dssouli and G. v. Bochmann, "Conformance testing with multiple observers," in Proc. fFlP WG6.I 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann, Eds. Amsterdam: North-Holland, 1986, pp. 217-229.
45. J. Edmonds and E. L. Johnson, "Matching, Euler tours and the Chinese postman," Mathematical Programm., vol. 5, pp. 88-124, 1973.
46. J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," JACM, vol. 19, no. 2, pp. 248-264, 1972.
47. J. Ellsberger and F. Kristoffersen, "Testability in the context of SDL," in Proc. IF/P WG6.1 12th hit. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn. Jr. and M. U. Uyari Eds. Amsterdam: North-Holland, 1992, pp. 319-334.
48. D. Eppstein, "Reset sequences for monotonie automata," SIAM J. Computing, vol. 19, no. 3, pp. 500-510, 1990.
49. S. Eswara, T. Berrian, P. VanHoutte, and B. Sarikaya, "Toward execution of TTCN test cases," in Proc. IF IP WC6.1 10th Int. Symp. on Protocol Specification, Testing, and Verification, L. Logrippo, R. L. Probert, and H. Ural Eds. Amsterdam: North-Holland, 1990, pp. 99-112.
50. J.-P. Favreau and R. J. Linn, Jr., "Automatic generation of test scenario skeletons from protocol specifications written in Estelle," in Proc. 1F1P WG6.1 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann, Eds. Amsterdam: North-Holland, 1986, pp. 191-202.
51. A. D. Friedman and P. R. Menon, Fault Detection in Digital Circuits. Englewood Cuffs, NJ: Prentice-Hall, 1971.
52. __, "Fault location in iterative logic arrays," Theory of Machines and Computations, Z, Kohavi and A. Paz, Eds. New York: Academic, 1972, pp. 327-340.
53. S. Fujiwara et al., "Test selection based on finite state models," IEEE Trans. Software Eng., vol. 17, pp. 591-603, 1991.
54. M. R. Garey and D. S. Johnson, Computers and intractability: A Guide to the Theory of HP-Completeness. New York: Freeman. 1979.
55. A. Ghedamsi and G. v. Bochmann, "Test result analysis and diagnostics for finite state machines," in Proc. 12th Int. Conf. un Distrib. Syst., 1992.
56. A. Ghedamsi, G. v. Bochmann, and R. Dssouii, "Multiple fault diagnostics for finite state machines," Proc. JNFOCOM 93, pp. 782-791, 1993.
57. A. Gill, "State-identification experiments in finite automata," Inform, and Comr., vol. 4, pp. 132-154, 1961.
58. __, Introduction to ike Theorv of Finite-State Machines. New York: McGraw-Hill, 1962.
59. S. M. Gobershtein. "Check words for the states of a finite automaton," Kibernetika, no. 1, pp. 46-49, 1974.
60. E. M. Gold, "Complexity of automaton identification from given data," Inform, and Contr., vol. 37, pp. 302-320, 1978.
61. G. Gor.cnc, "A method for the design of fault detection experiments," IEEE Trans. Computers, vol. C-19, pp. 551-558, 1980.
62. J. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines. Englewood Cliffs, NJ: Prentice-Hall, 1966.
63. W. Hengeveld and J. Kroon, "Using checking sequences for OS! session layer conforrnance testing," in Proc. IFIP WG6.1 7th Int. Syrnp. on Protocol Specification, Testing, and Verification, H. Rudm and C. H. West, Eds. Amsterdam: North-Holland, pp. 435-449, 1987.
64. F. C. Hennie, "Fault detecting experiments for sequential circuits," in Proc. 5th Ann. Svrnp. Switching Circuit Theory and Logical Design, pp. 95-110, 1964.
65. C. A. R. Hoare, Communicating Sequential Processes. Englewood Cliffs, NJ: Prentice-Hail, 1985.
66. G. J. Holzmann, Design and Validation of Protocols. Englewood Cuffs, NJ: Prentice-Hall, 1990.
67. J. E. Hopcroft, "An niogri algorithm for minimizing states in a finite automaton," in Theory of Machines and Compulations, Z. Kohavi and A. Paz, Eds. New York: Academic, 1971, pp. 189-196.
68. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: AddisonWesley, 1979.
69. E. P. Hsieh, "Checking experiments for sequential machines," IEEE Trans. Computer, vol. C-20, pp. 1152-1166, Oct. 1971.
70. J. Jain, J. Bitner, D. S. Fussell, and J. A. Abraham, "Probabilistic verification of Boolean functions," Forma! Methods in System Design, vol. 1, pp. 63-117, 1992.
71. B. Kanungo, L. Lamont, R. L. Probert, and H. Ural, "A useful FSM representation for test suite design and development," in Proc. IFIP WG6.1 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikayu and G. v. Bochmann, Eds. Amsterdam: North-Holland, 1986, pp. 163-176.
72. H K. Katsuyama. F. Sato, T. Nakakawaji, and T. Mizuno, "Strategic testing environment with forma! description techniques," IEEE Trans. Computers, vol. 40. pp. 514-525, Apr. 1991.
73. M. Keams and L, Valiant, "Cryptographic limitations on learning Boolean formulae and finite automata," in Proc. 21st Annu. ACM Symp. on Theory of Computing, 1989, pp. 433-44.
74. S. M. Kirn, R. McNaughton, and R. McCloskey, "A polynomial time algorithm for the local testability problem of deterministic finite automata," IEEE Trans. Computers, vol. 40, pp. S087-1093. Oct. 1991.
75. I. Kohavi and Z. Kohavi, "Variable-length distinguishing sequences and their application to the design of fault-detection experiments," IEEE Trans. Computer, vol. C-17, pp. 792-795, 1968.
76. Z. Kohavi, Switching and Finite Automata Theory, 2nd ed. New York: McGraw-Hill, 1978.
77. A. D. Korshunov, "On the degree of distinguishability of finite automata," Diskretnyi Analiz., pp. 39-59, 1967.
78. K. B. Krohn and J. L. Rhodes, "Algebraic theory of machines," in P roc. 1962 Syrnp. on Mathematical Theory of Automata, Microwave Research Institute Svmpossum Series, vol. 12. New York: Polytechnic, 1963.
79. M.-K. Kuan, "Graphic programming using odd or even points," Chinese Math., vol. 1, pp. 273-277, 1962.
80. R- P- Kurshan, Computer-aided Verification of Coordinating Processes. Princeton, NJ: Princeton Univ. Press, 1995.
81. E. Kwast, "Toward automatic test generation for protocol data aspects," in P roc. IF! P WG6.1 llth In!. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Farrow, and B. PehrsoH, Eds. Amsterdam: North-Holland, 1991, pp. 333-348.
82. J __, "Automatic test generation for protocol data aspects," in Proc. If IP WC6.J 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992. pp. 211-226.
83. K. Laia, Fault Tolerant and fault Testable Hardware Design. Englewoocl Cliffs, NJ: Prentice-Hall, 1985.
84. S. S. Lam and A. U. Shankar, "Protocol verification via projections," IEEE Traits. Software Encir.. vol. SE-10, no. 4, pp. 325-342, 1984.
85. E. L. Lawlar, Combinatorial Optimization: Networks and Matroids. Boston: Holt, Rinehart, and Winston, S976.
86. G. Leduc, "Conformance relation, associated equivalence, and new canonical lester in LOTOS," in Proc. IFIP WG6.1 llth Iml. Syrnp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pehrson, Eds. Amsterdam: NorthHolland, 1991, pp. 249-264.
87. D. Y. Lee and J. Y. Lee, "Test generation for the specification written in Estelle," in Proc. IFJP WG6.1 llth In!. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pehrson, Eds. Amsterdam: North-Holland, 1991, pp. 317-332.
88. __, "A well-defined Estelle specification for the automatic test generation," IEEE Trans. Computers, vo. 40, pp. 526-542, Apr. 1991.
89. D. Lee, A. N. Nctravali, and K. Sabnani, "Protocol pruning," Proc, IEEE, vol. 83, pp. 1357-1372, Oct. 1995.
90. D. Lee et ai "Passive testing and network management," to be published.
91. D. Lee and K. Sabnani, "Reverse-engineering of communication protocols," Proc. ICNP, pp. 208-216, 1993.
92. D. Lee, K. Sabnani, D. M. Kristol, and S. Paul, "Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach," to be published IEEE Trans. Commun.
93. D. Lee and FI. Wozniakowski. "Testing linear operators," BIT, vol. 35, pp. 331-351, 1995.
94. ___, "Testing nonlinear operators," Numer. Algorithms, vol. 9, pp. 319-342. 1995.
95. D. Lee and M. Yannakakis, "Testing finite state machines: state identification and verification." IEEE Trans. Computers, vol. 43, no. 3, pp. 306-320, 1994.
96. __, "On-line minimization of transition systems," in Proc. 24th Anna. ACM Svmp. on Theory of Computing, 1992, pp. 264-274.
97. __, "On-line minimization of transition systems-general methods," to be published.
98. S. Low, "Probabilistic conformance testing of protocols with unobservable transitions," Proc. ICNP, pp. 368-375, 1993.
99. R. S. Matthews, K. H. Muralidhar, and M. K. Shumacher, "Conformance testing: operational aspects, toois, and experiences," in Proc. IFIP WG6.1 6th Int. Symp, on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann Eds. Amsterdam: North-Holland, 1986, pp. 135-150.
100. J. de Meer, "Derivation and validation of test scenarios based on the formal specification language LOTOS," in Proc. IFIP WG6.1 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann, Eds. Amsterdam: North-Holland. 1986, pp. 203-216.
101. R. h. Miller and G. M. Lundy, "Testing protocol implementations based on a formal specification," Protocol Test Svslems III. Amsterdam: North-Holland, 1990, pp. 289-304.
102. R. H. Miller and S. Paul, "Generating minimal length test sequences for conformance testing of communication protocols," in Proc. INFOCOM, pp. 970-979, 1991.
103. __, "Generating conformance test sequences for combined control and data (low of communication protocols,'' in P roc. IFIP WG6.J I2ih Im. Syinp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. und M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 13-28.
104. R. Milner, Communication and Concurrency. Englcwood Cliffs, NJ: Prentice-Hall, 1989.
105. E. F. Moore, "Gedanken-experiments on sequential machines," Automata Studies. Princeton, NJ: Princeton L'niv. Press, Ann. Math. Studies, no. 34, pp. 129-153, 1956.
106. K. H. Muralidhar, "MAP 2.1 network management and directory services test system," in Pruc. If IP WG6.1 7th IntL Symp. on Protocol Specification, Testing, and Verification, H. Rudin and C. H. West, Eds. Amsterdam: North-Holland, pp. 359-372, 1987.
107. G. J. Myers, Softvsare Reliability: Principles & Practices. New York: Wiley, 1976.
108. S. Naito and M. Tsunoyama, "Fault detection for sequential machines hy transitions tours," in Proc. IEEE Fault Tolerant Comput. Symp., IEEE Computer Soc. Press, pp. 238-243, 1981.
109. J. S.' Nightingale, "Applicalion of the ISO distributed singlelayer testing method to the connectionless network protocol," in Proc. it IP WG6.1 6th Int. Sainp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. v. Bochmann, Eds. Amsterdam: North-Holland, 1986, pp. 123-134.
110. J. Pachl, "A notation for specifying test selection criteria," in Prof. IFIP WG6.1 JOlh Intl. Symp. on Protocol Specification, Testing, and Verification, L. Logrippo, R. L. Probert, and H. Ural, Eds. Amsterdam: North-Holland, 1990, pp. 71-84.
111. A. Petrenko and N. Yevtushenko, "Test suit generation from an FSM with a given type of implementation errors," in Proc. IFIP WG6. 1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Lvar. Eds. Amsterdam: North-Holland, 1992, pp. 229-244.
112. D. H. Piu and D. Freestone, "The Derivation of conformance tests from LOTOS specifications," IEEE Trans. Software Eng., vol. 16, pp. 1337-1343, Dec. 1990.
113. L. Pin and M. Warmath, "The minimum consistent DFA problem cannot be approximated within any polynomial," J. ACM, vol. 40, no. 1, pp. 95-142, 1993.
114. R. L. Probert, H. Ural, and M. W. A. Hornbeek, "An integrated software environment for developing and validating standardized conformance tests," in Proc. IFJP WG6.1 8th Int. Symp. on Protocol Specification, Testing, and Verification, S. Aggarwal and K. Sabnani, Eds. Amsterdam: North-Holland. 1988, pn. 87-98.
115. E. P. Raihgeb, C. Homann, H. L. Truong, and G. Waldmann, "Protocol testing for the ISDN D-channel network layer," in Proc. IFIP WG6.1 7th Int. Symp. on Protocol Specification, Testing, and Verification, H. Rudin and C. H. West, Eds. Amsterdam: North-Holland, 1987, pp. 421-434.
116. R. L. Rivest and R. E. Schapire, "Inference of finite automata using homing sequences," in Proc. 21st Annu. ACM Symp. on Theory of Computing, 1989, pp. 411-420.
117. M. Rodrigues and H. Ural, "Exact solutions for the construction of optimal length test sequences," Informat. Process. Lett., vol. 48, pp. 275-280, 1993.
118. S. Rudich, "Inderring the structure of a Markov chain from its output," in Proc. 26th Annu. Svnip. on Foundations of Computer Sei., 1985, pp. 321-326.
119. K. K. Sabnani and A. T. Dahbura, "A protocol test generation procedure," Computer Networks and ISDN Syst., vol. 15, no. 4, pp. 285-297: 1988,
120. B. Sarikaya and G. v. Bochmann, "Some experience with test sequence generation," in Proc. 2nd Int. Workshop on Protocol Specification, Testing, and Verification, C. Sunshine, Ed. Amsterdam: North-Holland, 1982, pp. 555-567.
121. B. Sarikaya and G. v. Bochrnanr., "SynchroniJ.ation and specification issues in protocol testing," IEEE Trans. Commun., vol. COM-32, pp. 389-395, Apr. 1984.
122. B. Sarikaya, G. v. Bochmann, and E. Cerny, "A test design methodology for protocol testing," IEEE Trans. Software Eng., vol. SE-13, pp. 518-531, Apr. 1987.
123. B. Sarikaya and Q. Gao, "Translation of te&t specifications in TTCN to LOTOS," in Proc. IFIP WG6.1 8th Int. Symp. on Protocol Specification, Testing, and Verification, S. Aggarwal and K. Sabnani, Eds. Amsterdam: North-Holland, 1988, pp. 219-230.
124. C. L. Seitz, "An approach to designing checking experiments based on a dynamic model," Theory of Machines and Computations, Z. Kohavi and A. Paz, Ed. Amsterdam: Academic, 1972. pp. 341-349.
125. Y. N. Shen, F. Lombards and A. T. Dahbura, "Protocol conformance testing using multiple U1O sequences," in Proc. IFIP WG6.1 gth 9th Symp. on Protocol Specification, Testing, and Verification, E. Brinksma, G. Scoilo, and C. A. Vissers, Eds. Amsterdam: North-Holland, 19S9, pp. 131-144.
126. D. Sidhu, "Protocol testing: the first ten years, the next ten years," in Proc. IF IP WG6.1 10th Im. Symp. on Protocoi Specification, Testing, and Verification, L. Logrippo, R. L. Proben, and H. Ural, Eds. Amsterdam: North-Holland, 1990, pp. 45-68.
127. D, P. Sidhu and T.-K. Leung, "Experience with test generation for real protocols," Proc. S1CCOM, pp. 257-261, 1988.
128. ___, "Formal methods for protocol testing: a detailed study," IEEE Trans. Software Eng., vol. 15, no. 4, pp. 413-426, 1989.
129. M. N. Sokolovskii, "Diagnostic experiments with automata," Kibernetika, no. 6, pp. 44-49, 1971.
130. X. Sun, Y.-N. Shen, F. Lombardi, and D. Sciuto, "Protocol conformance testing by discriminating UIO sequences," in Proc. IFIP WG6.1 llth Int. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pehrson, Ed. Amsterdam: North-Holland, 1991, pp. 349-364.
131. A. S. Tanenbaum, Computer Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1988.
132. R. E. Tarjan, Data Structures and Nenvork Algorithms. New York: Soc. Indust. and Appl. Math., 1983.
133. B. A. Trakhtenbrot and Y. M. Barzdin, Finite Automata, Behavior and Synthesis. Amsterdam: North-Holland, 1973.
134. P. Tripathy and B. Sarikaya, "Test generation from LOTOS specifications."
135. H. Ural, "A lest derivation method for protocol conformance testing," in Proc. IF IP WC6.1 7th Int. Symp. on Protocol Specification, Testing, and Verification, H. Rudin and C. H. West, Eds. Amsterdam: North-Hollaed, 1987. pp. 347-358.
136. H. Ural and R. L. Probert, "User-guided test sequence generation," in Proc. IFIP WG6.1 3rd Int. Symp. on Protocol Specification, Testing, and Verification, H. Rudin and C. H. West, Eds. Amsterdam: North-Holland, 1983, pp. 421-436.
137. M. U. Uyar and A. T. Dahbura, "Optimal test sequence generation for protocols: the Chinese postman algorithm applied to Q.931," in Proc. IEEE Global Telecommim. Conf., 1986.
138. L. G. Valiant, "A theory of learnable," CACM, vol. 27, pp. 1134-1142, 1984.
139. M. P. Vasilevskii, "Failure diagnosis of automata," Kibernetika, no. 4, pp. 98-108, 1973.
140. R. J. Velthuys, J. M. Schneider, and G. Zorntlein, "A lesi derivation method based on exploiting structure information," in Proc. IFIP WC6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn. jr. and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 195-210.
141. F. Wagner, "VFSM executable specification," in Proc. CompEuro, 1992.
142. B. Wang and D. Hutchinson, "Protocoi testing techniques," Computer Commun., vol 10, no. 2, pp. 79-87, 1987.
143. C.-J. Wang and M. T. Liu. "A test suite generation method for extended finite state machines using axiomatic semantics approach," in Proc. IFIP WG6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, R. J. Linn, Jr. and M. U. Uyar, Eds. Amsterdam: North-Holland, 1992, pp. 29-13.
144. __, "Generating test cases for EFSM with given fault models," in Proc. INFOCOM, pp. 774-781, 1993.
145. C. Wang and M. Schwanz, "Fault detection with multiple observers," IEEE/ACM Trans, on Networking, vol. 1, no. 1, pp. 48-55, 1993.
146. C. West, "Protocoi validation by random slate exploration," in Proc. IFIP WG6.1 6th Int. Symp. on Protocol Specification, Testing, and Verification, B. Sarikaya and G. Bochmann, Eds. Amsterdam: North-Holland, 1986.
147. C. D. Wezeman, "The CO-OP method for compositional derivation of conformance (esters," in P roc. IF1P WG6.1 9th Int. Symp. on Protocol Specification, Testing, and Verification, E. Brinksma, G. Scolio, and C. A. Vissers. Ed. Amsterdam: North-Holland, 1989, pp. 145-160.
148. R. Wvong, "LAPB conformance testing using trace analysis," in Proc. 1FIP WG6.1 llth Int. Symp. on Protocol Specification, Testing, and Verification, B. Jonsson, J. Parrow, and B. Pchrson, Eds. Amsterdam: North-Holland, 1991, pp. 267-282.
149. B. Yang und H. Ural, "Protocol conformance test generation using multiple UIO sequences with overlapping," Proc. S1GCOM, pp 118-125, 1990.
150. M. Yannakakis and D. Lee, "Testing finite state machines," in Proc. 23rd Annu. ACM Symp. on Theory of Conipul., 1991, pp. 476-485.
151. __, "Testing finite state machines: fault detection," J. Computer and Syst. Sei., vol. 50, no. 2, pp. 209-227, 1995.
152. __, "An efficient algorithm for minimizing real-time transition systems," Proc. CAV, pp. 210-224, 1993.
153. W. Yi and K. G. Larsen, "Testing probabilistic and nondeierniinistic processes," in Proc. It'IP WC6.1 12th Int. Symp. on Protocol Specification, Testing, and Verification, M. U. Uyar and J. Linn, Eds. Amsterdam: North-Holland, 1992, pp. 47-62.
154. H. X. Zeng, X. F. Du, and C. S. He. "Promoting the local test method with the new concept ferry clip," in Proc. 1FIP WG6.1 8th Int. Symp. on Protocol Specification, Testing, and Verification, S. Aggarwal and K. Subnani, Ed. Amsterdam: North-Holland, 1988, pp. 231-241