Abstract
This part of the book is concerned with the theory of model-based testing where real systems are assumed to be modeled as labeled transition systems (and extensions thereof). Labeled transition systems were proposed by Keller [Kel76] and are widely used as underlying models for data-intensive systems (sequential and concurrent programs) as well as hardware circuits. The starting point of this form of model-based testing is a precise, unambiguous model description of the system under test. Based on this formal specification, test generation algorithms generate provably valid tests, i.e., tests that test what should be tested and no more than that. These algorithms provide automatic, faster and less error-prone test generation facilities. A sketch of the testing approach is given in Figure 9.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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
Broy, M., Jonsson, B., Katoen, JP., Leucker, M., Pretschner, A. (2005). Part II. Testing of Labeled Transition Systems. 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_6
Download citation
DOI: https://doi.org/10.1007/11498490_6
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)