Abstract
This chapter deals with the verification of systems that are generated out of similar or identical finite state components, using a simple rule. Systems of this type are commonplace — they occur in bus protocols and network protocols, I/O channels, and many other structures that are designed to be extensible by adding similar components. In particular, we are interested in verifying properties that hold independent of the number of components in the system. We may for example have used a model checker to verify some property of a multiprocessor with a fixed number of processors. Would that property continue to hold if we added one more processor. One hundred? One thousand? Clearly, at some point we will be unable to answer the question with the model checker alone. It would be far preferable to settle the question once and for all, regardless of the number of processors.
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
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
McMillan, K.L. (1993). Induction and Model Checking. In: Symbolic Model Checking. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3190-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3190-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6399-6
Online ISBN: 978-1-4615-3190-6
eBook Packages: Springer Book Archive