Synchronization and Specification Issues in Protocol Testing

IEEE Transactions on Communications

Volumn 32, Issue 4, 1984, Pages 389-395

  Bochmann, Gregor V ^a   Sarikaya, Behcet ^b  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA;

FINITE STATE MACHINE (FSM); PROTOCOL TESTING; SYNCHRONIZATION; TEST SEQUENCE GENERATION ALGORITHMS;

COMPUTER NETWORKS;

EID: 0021412054     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1984.1096074     Document Type: Article

References (22)

1. D. Belsnes and E. Lynning, “Some problems with the X.25 packet level protocol,” Comput. Commun. Rev., vol. 7, no. 4, pp. 41–52, 1977.
2. G. v. Bochmann et al. “Experience with formal specifications using an extended state transition model,” IEEE Trans. Commun., vol. COM-30, pp. 2506–2513, Dec. 1982.
3. G. V. Bochmann et. al, “Testing transport protocol implementations,” in Proc. Can. Inform. Processing Soc. Conf., May 1983, pp. 123–129.
4. G. v. Bochmann and E. Cemy, “Protocol assessment,” Rep. Dep.-Commun. Canada, Feb. 1982.
5. “Recommendation X.25,” CCITT Study Gxeamroup VII, Working Paper 2, pp. 100–190, fasc. VIII.2, Sept. 1981.
6. H. Chaigne et al., “Un generateur de tests pour systemes modelises par automates d'etats finis,” BIGRE (IRISA), Rennes, France, no. 27, Dec. 1981.
7. T. S. Chow, “Testing software design modeled by finite state machines,” IEEE Trans. Software Eng., vol. SE-4, no. 3, 1978.
8. S. Even, Graph Algorithms. Rockville, MD: Comput. Sci. Press, 1979.
9. G. Gonenc, “A method for the design of fault detection experiments,” IEEE Trans. Comput., vol. C-I9, no. 6, 1970.
10. Several papers in Proc. 2nd Int. Workshop Protocol Specification, Testing, Verification, 1982.
11. ISO, “ Connection oriented transport protocol specification,” Apr. 1983.
12. ISO, “A FDT based on an extended state transition model,” working doc. of Subgroup B, ISO TC97/SC161 WGl, Mar. 1984.
13. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1978.
14. P. F. Linington, Ed., “A network independent transport service,” Feb. 1980.
15. S. Naito and M. Tsunoyama, “Fault detection for sequential machines by transition tours,” in Proc. IEEE Fault Tolerant Comput. Conf., 1981.
16. T. F. Piatkowski, “On the feasibility of validating and testing ADCCP implementations,” NBS Trends Appl., May 1980.
17. D. Rayner, “A system for testing protocol implementations,” in Proc. 2nd Int. Workshop Protocol Specification, Testing, Verification, 1982; also Comput. Networks, vol. 6, Dec. 1982.
18. R. Razouk, “Modelling X.25 using the graph model of behavior,” in Proc. 2nd Int. Workshop Protocol Specification, Testing, Verification, 1982.
19. R. Rubin and C. H. West, “An improved protocol validation technique,” Comput. Newtorks, May 1982.
20. B. Sarikaya and G. v. Bochmann, “Some experience with test sequence generation for protocols,” in Proc. 2nd Int. Workshop Protocol Specification, Testing, Verification, 1982.
21. B. Sarikaya, “Test design for computer network protocols,” McGill Univ., Montreal, P.Q., Canada, to be published, 1984.
22. R. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Comput., vol. 1, no. 2, 1972.