Gábor Árpád Németh and Máté István Lugosi

Test generation algorithm for the All-Transition-State criteria of Finite State Machines

In the current article a novel test generation algorithm is presented for deterministic finite state machine specifications based on the recently introduced All-Transition-State criteria. The size of the resulting test suite and the time required for test suite generation are investigated through analytical and practical analyses and are also compared to the Transition Tour, Harmonized State Identifiers and random walk test generation methods. The fault detection capabilities of the different approaches are also investigated with simulations applying randomly injected transfer faults.

Reference:

DOI: 10.36244/ICJ.2021.3.6

Download 

Please cite this paper the following way:

Gábor Árpád Németh and Máté István Lugosi, "Test generation algorithm for the All-Transition-State criteria of Finite State Machines", Infocommunications Journal, Vol. XIII, No 3,  September 2021, p. 56-65., https://doi.org/10.36244/ICJ.2021.3.6

Technical Co-Sponsors


  

  

 

Supporter

National Cooperation Fund, Hungary