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 \(2{^{n}}^{^2}\). The upper bound on a shortest adaptive homing sequence of a NFSM with m initial states, m ( n, states is of order \(\sum\limits_{j=2}^m C_n^j\) and this upper bound is of order 2n when m tends to n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies (Annals of Mathematical Studies), vol. 1, pp. 129–153. Princeton University Press, Princeton (1956)
Kohavi, Z.: Switching and Finite Automata Theory. McGraw- Hill, New York (1978)
Mathur, A.: Foundations of Software Testing. Addison-Wesley, Reading (2008)
Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. on Computers 43(3), 306–320 (1994)
Ravikumar, B.: IPPS-WS 1998 and SPDP-WS 1998. Lecture Notes in Compute Science, vol. 1388, p. 373. Springer, Berlin (1998)
Sandberg, S.: 1 homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)
Ginsburg, S.: On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. Journal of the ACM 5(3), 266–280 (1958)
Hibbard, T.N.: Lest upper bounds on minimal terminal state experiments of two classes of sequential machines. Journal of the ACM 8(4), 601–612 (1961)
Gill, A.: State-identification experiments in finite automata. Information and Control, 132–154 (1961)
Milner, R.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)
Rystsov, I.: Rank of finite automata. Cybernetics and Systems Analysis 28(3), 323–328 (1992)
Burkhard, H.V.: Zum Langenproblem homogener Experimente an determinierten und nicht-deterministischen. EIK 12, 301–306 (1976)
Imresh, B., Steinby, M.: Directable non-deterministic automata. Acta Informatica 14, 105–115 (1999)
Imresh, B., Imresh, C., Ito, M.: On directable non-deterministic trapped automata. Acta Informatica 16, 37–45 (2003)
Starke, P.: Abstract Automata, pp. 3–419. American Elsevier, Amsterdam (1972)
Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proc. the 27th ACM Symposium on Theory of Computing, pp. 363–372 (1995)
Spitsyna, N., El-Fakih, K., Yevtushenko, N.: Studying the separability relation between finite state machines. Software Testing, Verification and Reliability 17(4), 227–241 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kushik, N., El-Fakih, K., Yevtushenko, N. (2011). Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-22256-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22255-9
Online ISBN: 978-3-642-22256-6
eBook Packages: Computer ScienceComputer Science (R0)