Reducing locating sequences for testing from finite state machines

Jourdan, Guy Vincent and Ural, Hasan and Yenigün, Hüsnü (2016) Reducing locating sequences for testing from finite state machines. In: 31st Annual ACM Symposium on Applied Computing (SAC'16), Pisa, Italy

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1145/2851613.2851831


When testing from a deterministic Finite State Machine specification M of an implementation N, state identification plays an essential role. In the case that M does not have a single input sequence to identify its states, state identification has to be performed by using a set of input sequences, elements of which need to be applied at the same state of N. Locating sequences have been proposed in the literature in order to guarantee that N is brought back to the same state over and over, in order to apply these input sequences. Although the lengths of locating sequences are exponential in general, there are some methods proposed in the literature to reduce their length. In this paper, we present an improved method for reducing the length of locating sequences. We give a formal description of our method and explain how the existing methods relate to our method.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:Checking sequences; Finite state machines; Locating sequences; Model-based testing; State identification
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Q Science > QA Mathematics > QA076 Computer software
ID Code:29403
Deposited By:Hüsnü Yenigün
Deposited On:15 Jul 2016 15:35
Last Modified:15 Jul 2016 15:35

Repository Staff Only: item control page