Abstract
In this chapter, we deal with the problem of state identification of finite-state Mealy machines. Before defining the problem formally, let us illustrate it with a few examples and point out its differences with the similar problem of finding a homing sequence.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Krichen, M. (2005). 2 State Identification. In: Broy, M., Jonsson, B., Katoen, JP., Leucker, M., Pretschner, A. (eds) Model-Based Testing of Reactive Systems. Lecture Notes in Computer Science, vol 3472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11498490_3
Download citation
DOI: https://doi.org/10.1007/11498490_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26278-7
Online ISBN: 978-3-540-32037-1
eBook Packages: Computer ScienceComputer Science (R0)
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
