Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines

In this paper, we present algorithms for preset and adaptive homing experiments for a given observable reduced nondeterministic finite state machine (NFSM). We show that the tight upper bound on a shortest preset homing sequence for a NFSM with n states and with two or more initial states is of order 2n2. The upper bound on a shortest adaptive homing sequence of a NFSM with m initial states, m ≤ n, states is of order Σj=2m Cnj and this upper bound is of order 2n when m tends to n.

[1]  David Lee,et al.  Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[4]  Bala Ravikumar,et al.  Parallel Algorithms for Finite Automata Problems , 1998, IPPS/SPDP Workshops.

[5]  Aditya P. Mathur,et al.  Foundations of Software Testing , 2007 .

[6]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[7]  Niraj K. Jha,et al.  Switching and Finite Automata Theory , 2010 .

[8]  Seymour Ginsburg,et al.  On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine , 1958, JACM.

[9]  Balázs Imreh,et al.  Directable Nondeterministic Automata , 1999, Acta Cybern..

[10]  Balázs Imreh,et al.  On directable nondeterministic trapped automata , 2003, Acta Cybern..

[11]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004] , 2005, Model-Based Testing of Reactive Systems.

[12]  Thomas N. Hibbard,et al.  Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines , 1961, JACM.

[13]  I. K. Rystsov,et al.  Rank of a finite automaton , 1992 .

[14]  Hans-Dieter Burkhard,et al.  Zum Längenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten , 1976, J. Inf. Process. Cybern..

[15]  Arthur Gill,et al.  Sate-Identification Experiments in Finite Automata , 1961, Inf. Control..

[16]  Sven Sandberg,et al.  Homing and Synchronizing Sequences , 2004, Model-Based Testing of Reactive Systems.

[17]  N. Yevtushenko,et al.  Studying the separability relation between finite state machines , 2007 .

[18]  Rajeev Alur,et al.  Distinguishing tests for nondeterministic and probabilistic machines , 1995, STOC '95.