Abstract
This chapter considers two fundamental problems for Mealy machines, i.e., finite-state machines with inputs and outputs. The machines will be used in subsequent chapters as models of a system or program to test. We repeat Definition 21.1 of Chapter 21 here: readers already familiar with Mealy machines can safely skip to Section 1.1.2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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
Sandberg, S. (2005). 1 Homing and Synchronizing Sequences. 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_2
Download citation
DOI: https://doi.org/10.1007/11498490_2
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)