Um estratégia para geração de seqüências de verificação para máquinas de estados finitos

Content Provider	Semantic Scholar
Author	Ribeiro, Paulo Henrique
Copyright Year	2010
Abstract	Software testing involves several techniques, methods, and concepts employed to guarantee a high level of quality in different application domains. Among such techniques, Finite State Machine (FSM) based testing aims to guarantee the conformance between the implementation and the specification of a system under test. In this context, several methods were proposed to generate checking sequences that cover all the possible faults existing in an implementation. Most of these methods are based on a special sequence, named distinguishing sequence, which does not exist for every minimal machine. Some methods were proposed to generate checking sequences based on alternative solutions in order to be applied on FSMs that do not have distinguishing sequences. However, these methods generate checking sequences exponentially long. This work proposes a method to generate checking sequences using identification sets. These sets exist for every minimal FSM and also lead to shorter checking sequences. We conducted an experimental study to compare the proposed method with the main existing methods. In the experiments, we used random FSMs that have different configurations of states, inputs, and outputs. Concerning the variation of number of states, the results show reductions higher than 99.5% in comparison with the existing methods for 75% of the experimented machines.
File Format	PDF HTM / HTML
DOI	10.11606/D.55.2010.tde-19012011-144153
Alternate Webpage(s)	https://teses.usp.br/teses/disponiveis/55/55134/tde-19012011-144153/publico/paulohenrique.pdf
Alternate Webpage(s)	https://doi.org/10.11606/D.55.2010.tde-19012011-144153
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article