Adaptive Homing is in P

Natalia Kushik
(Tomsk State University)
Nina Yevtushenko
(Tomsk State University)

Homing preset and adaptive experiments with Finite State Machines (FSMs) are widely used when a non-initialized discrete event system is given for testing and thus, has to be set to the known state at the first step. The length of a shortest homing sequence is known to be exponential with respect to the number of states for a complete observable nondeterministic FSM while the problem of checking the existence of such sequence (Homing problem) is PSPACE-complete. In order to decrease the complexity of related problems, one can consider adaptive experiments when a next input to be applied to a system under experiment depends on the output responses to the previous inputs. In this paper, we study the problem of the existence of an adaptive homing experiment for complete observable nondeterministic machines. We show that if such experiment exists then it can be constructed with the use of a polynomial-time algorithm with respect to the number of FSM states.

In Nikolay Pakulin, Alexander K. Petrenko and Bernd-Holger Schlingloff: Proceedings Tenth Workshop on Model Based Testing (MBT 2015), London, UK, 18th April 2015, Electronic Proceedings in Theoretical Computer Science 180, pp. 73–78.
Published: 10th April 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.180.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org