Abstract
In this paper, testing of deterministic implementations of nondeterministic specification FSMs is considered. Given two nondeterministic FSMs, a black box deterministic FSM is known to be a correct implementation of at least one them. We want to derive a test that determines whether this black box is a correct implementation of the first NDFSM. No upper bound on the number of states of the black box is known. The necessary and sufficient conditions for test existence are found. A method for constructing a conditional test of a minimal length is proposed. Upper bounds of multiplicity, length and overall length close to minimal are obtained.
Chapter PDF
References
Boroday, S. Yu. (1995) Experiments in classes of NDFSM implementations. Proceeding of II Ukrainian conference on automatic control ‘Automatika 95’, Lvov, p 101.
Lukjanov B. D. (1995) On distinguishing and checking experiments with nondeterministic automata, Kibernetika i systemny analiz, 5. Plenum Publishing Corporation. New York. pp. 56 - 66.
Petrenko, A., Yevtushenko, N., Lebedev, A., Das, A. (1993) Nondeterministic state machines for protocol testing. IFIP Transactions Protocol Test Systems VI (the Proceedings of IFIP TC6 Sixth international Workshop on Protocol Test Systems 1993) North-Holland, 1994, pp. 193 - 208.
Petrenko, A., Yevtushenko, N., Bochmann G. (1996) Testing deterministic implementations from nondeterministic FSM specifications. IFIP Testing of Communicating Systems (the Proceedings of IFIP TC6 9th International Workshop on Protocol Test Systems 1996) Chapman & Hall, 1996, pp 125 - 140.
Starke, P.H. (1972) Abstract automata. North-Holland/American Elsevier, 419 p.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Boroday, S.Y. (1998). Distinguishing tests for nondeterministic finite state machines. In: Petrenko, A., Yevtushenko, N. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35381-4_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-35381-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6703-2
Online ISBN: 978-0-387-35381-4
eBook Packages: Springer Book Archive