Efficient checking sequences for testing finite state machines

İnan, Kemal and Ural, H. (1999) Efficient checking sequences for testing finite state machines. Information and Software Technology, 41 (11-12). pp. 799-812. ISSN 0950-5849

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/S0950-5849(99)00038-5


A general model for constructing minimal length checking sequences is proposed. The model is based on the characteristics of checking sequences and sets of state identification and verification sequences. Some existing methods are shown to be special cases of the proposed model. The minimality of the resulting checking sequences is discussed and heuristic algorithms for the construction of minimal length checking sequences given.

Item Type:Article
Uncontrolled Keywords:checking sequence; Mealy automaton; distinguishing suite; state identification and verification
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Q Science > QA Mathematics > QA076 Computer software
ID Code:14288
Deposited By:Kemal İnan
Deposited On:27 Aug 2010 10:17
Last Modified:25 Jul 2019 12:31

Repository Staff Only: item control page