Preset and adaptive homing experiments for nondeterministic finite state machines

Authors:
Natalia Kushik;Khaled El-Fakih;Nina Yevtushenko
Affiliations:
Tomsk State University, Tomsk, Russia;American University of Sharjah, UAE;Tomsk State University, Tomsk, Russia
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 10
Cited 1

Distinguishing tests for nondeterministic and probabilistic machines

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Directable nondeterministic automata

Acta Cybernetica
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Journal of the ACM (JACM)
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Testing Finite-State Machines: State Identification and Verification

IEEE Transactions on Computers
On directable nondeterministic trapped automata

Acta Cybernetica
Studying the separability relation between finite state machines

Software Testing, Verification & Reliability
Foundations of Software Testing

Foundations of Software Testing

On the length of homing sequences for nondeterministic finite state machines

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.