Minimizing coordination channels in distributed testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4229 LNCS, Issue , 2006, Pages 451-466

  Jourdan, Guy Vincent ^a   Ural, Hasan ^a   Yenigün, Hüsnü ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b SABANCI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMPUTER ARCHITECTURE; COMPUTER TESTING; NUMERICAL METHODS; ARCHITECTURE; FORMAL METHODS;

BIDIRECTIONAL COORDINATION CHANNELS; CHECKING SEQUENCES; TRANSITIVE COORDINATIONS; CHECKING SEQUENCE; DISTRIBUTED SYSTEMS; DISTRIBUTED TEST ARCHITECTURE; DISTRIBUTED TESTING; MINIMIZING THE NUMBER OF; SYSTEM UNDER TEST; TEST ARCHITECTURE;

DISTRIBUTED COMPUTER SYSTEMS; TESTING;

EID: 33750538837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_32     Document Type: Conference Paper

References (23)

1. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines -A survey. In: Proceedings of the IEEE. Volume 84. (1996) 1090-1126
2. Gill, A.: Introduction to The Theory of Finite State Machines. McGraw Hill, New York (1962)
3. Ural, H., Wu, X., Zhang, F.: On minimizing the length of checking sequences. IEEE Transactions on Computers 46 (1997) 93-99
4. Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Transactions on Computers 51 (2002) 1111-1117
5. Tekle, K.T., Ural, H., Yalcin, M.C., Yenigun, H.: Generalizing redundancy elimination in checking sequences. In: ISCIS 2005, LNCS 3733. (2005) 915-926
6. Yao, M., Petrenko, A., v. Bochmann, G.: Conformance testing of protocol machines without reset. In: Protocol Specification, Testing and Verification. Volume XIII. (1993) 241-256
7. Chen, J., Hierons, R., Ural, H.: Conditions for resolving observability problems in distributed testing. In: FORTE 2004, LNCS 3235. (2004) 229-242
8. Chen, X.J., Hierons, R.M., Ural, H.: Resolving observability problems in distributed test architecture. In: IFIP FORTE 2005, LNCS 3731. (2005) 219-232
9. Sarikaya, B., v. Bochmann, G.: Synchronization and specification issues in protocol testing. IEEE Transactions on Communications 32 (1984) 389-395
10. Luo, G., Dssouli, R., Bochmann, G.V., Venkataram, P., Ghedamsi, A.: Test generation with respect to distributed interfaces. Comput. Stand. Interfaces 16 (1994) 119-132
11. Tai, K., Young, Y.: Synchronizable test sequences of finite state machines. Computer Networks and ISDN Systems 30 (1998) 1111-1134
12. Hierons, R.M.: Testing a distributed system: Generating minimal synchronised test sequences that detect output-shifting faults. Information and Software Technology 43 (2001) 551-560
13. Khoumsi, A.: A temporal approach for testing distributed systems. Software Engineering, IEEE Transactions on 28 (2002) 1085-1103
14. Wu, W.J., Chen, W.H., Tang, C.Y.: Synchronizable for multi-party protocol conformance testing. Computer Communications 21 (1998) 1177-1183
15. Cacciari, L., Rafiq, O.: Controllability and observability in distributed testing. Inform. Software Technol. 41 (1999) 767-780
16. Boyd, S., Ural, H.: The synchronization problem in protocol testing and its complexity. Information Processing Letters 40 (1991) 131-136
17. Dssouli, R., von Bochmann, G.: Error detection with multiple observers. In: Protocol Specification, Testing and Verification. Volume V., Elsevier Science (North Holland) (1985) 483-494
18. Dssouli, R., von Bochmann, G.: Conformance testing with multiple observers. In: Protocol Specification, Testing and Verification. Volume VI., Elsevier Science (North Holland) (1986) 217-229
19. Rafiq, O., Cacciari, L.: Coordination algorithm for distributed testing. The Journal of Supercomputing 24 (2003) 203-211
20. Hierons, R.M., Ural, H.: Uio sequence based checking sequence for distributed test architectures. Information and Software Technology 45 (2003) 798-803
21. Chen, J., abd H. Ural, R.M.H.: Overcoming observability problems in distributed test architectures. (Information Processing Letters) to appear.
22. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1 (1972) 146-160
23. Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5 (1976) 653-665