Eliminating redundant tests in a checking sequence

Chen, Jessica and Hierons, Robert M. and Ural, Hasan and Yenigün, Hüsnü (2005) Eliminating redundant tests in a checking sequence. Lecture notes in computer science, 3502 . pp. 146-158. ISSN 0302-9743 (Print) 1611-3349 (Online)

Full text not available from this repository. (Request a copy)


Under certain well–defined conditions, determining the correctness of a system under test (SUT) is based on a checking sequence generated from a finite state machine (FSM) specification of the SUT. When there is a distinguishing sequence for the FSM, an efficient checking sequence may be produced from the elements of a set of -sequences that verify subsets of states and the elements of a set EC of subsequences that test the individual transitions. An optimization algorithm may be used in order to produce a shortest checking sequence by connecting the elements of and EC using transitions drawn from an acyclic set. Previous work did not consider whether some transition tests may be omitted from EC. This paper investigates the problem of eliminating subsequences from EC for those transitions that correspond to the last transitions traversed when a distinguishing sequence is applied in an –sequence to obtain a further reduction in the length of a checking sequence.
Item Type: Article
Additional Information: 17th IFIP TC6/WG 6.1 International Conference, TestCom 2005, Montreal, Canada, May 31 - June, 2005. Proceedings - Book: Testing of Communicating Systems / ISBN: 978-3-540-26054-7
Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Hüsnü Yenigün
Date Deposited: 21 Nov 2005 02:00
Last Modified: 15 May 2009 09:27
URI: https://research.sabanciuniv.edu/id/eprint/629

Actions (login required)

View Item
View Item