Generalizing redundancy elimination in checking sequences

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

Volumn 3733 LNCS, Issue , 2005, Pages 915-926

  Tekle, K Tuncay ^a   Ural, Hasan ^b   Yalcin, M Cihan ^a   Yenigun, Husnu ^a  

^a SABANCI UNIVERSITY   (Turkey)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FINITE AUTOMATA; INFORMATION RETRIEVAL; OPTIMIZATION; SET THEORY;

CHECKING SEQUENCES; FINITE STATE MACHINE (FSM); REDUNDANCY ELIMINATION;

REDUNDANCY;

EID: 33646516379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11569596_93     Document Type: Conference Paper

References (16)

1. Tanenbaum, A.S.: Computer Networks. 3rd edn. Prentice Hall International Editions, Prentice Hall (1996)
2. Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York (1962)
3. Hennie, P.C.: Fault-detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey (1964) 95-110
4. Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks 15 (1988) 285-297
5. Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1978)
6. Lee, D., Yannakakis, M.: Testing finite state machines: state identification and verification. IEEE Trans. Computers 43 (1994) 306-320
7. Gonenc, G.: A method for the design of fault detection experiments. IEEE Transactions on Computers 19 (1970) 551-558
8. Ural, H., Wu, X., Zhang, F.: On minimizing the lengths of checking sequences. IEEE Transactions on Computers 46 (1997) 93-99
9. Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Transactions on Computers 51 (2002) 1111-1117
10. Chen, J., Hierons, R., Ural, H., Yenigun, H.: Eliminating redundant tests in a checking sequence. In: 17th IFIP International Conference on Testing of Communicating Systems. Volume 3502 of Lecture Notes in Computer Science., Montreal, Canada (2005) 146-158
11. Lee, D., Yannakakis, M.: Principles and methods of testing finite-state machines - a survey. Proceedings of the IEEE 84 (1996) 1089-1123
12. Miller, R.E., Paul, S.: On the generation of minimal-length conformance tests for communication protocols. IEEE/ACM Transactions on Networking 1 (1993) 116-129
13. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)
14. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In: Proceedings of Fifth ACM-SIAM Symposium on Discrete Algorithms. (1994) 344-354
15. Fujito, T.: A note on approximation of the vertex cover and feedback vertex set problems. Information Processing Letters 59 (1996) 59-63
16. Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Transactions on Computers (2004) submitted.