Abstract
Finite state achines have been used to model a wide variety of systems, including sequential circuits, communication protocols, and other types of reactive systems, i.e., systems that interact with their environment. In testing problems we are given a system, which we may test by providing inputs and observing the outputs produced. The goal is to design test sequences so that we can deduce desired information about the given system under test, such as whether it imple- ments correctly a given specification machine (conformance testing), or whether it satisfies given requirement properties (black-box checking).
In this talk we will review some of the theory and algorithms on basic testing problems for systems odeled by different types of finite state achines. Conformance testing of deter inistic achines has been investigated for a long time; we will discuss various efficient ethods. Testing of nondeter inistic and probabilistic achines is related to games with incomplete infor ation and to partially observable Markov decisions processes.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yannakakis, M. (2002). Testing and Checking of Finite State Systems. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive