Abstract
Digital circuits usually contain storage elements like flipflops, registers or RAMs. Thus we have to cope with sequential circuits, where the current output may depend not only on the current input but also on previous values (Fig. 3–1). Boolean functions as presented in Chapter 2 lack sufficient expressiveness to model this kind of behavior and we have to use more powerful formalisms.
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
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kropf, T. (1999). Approaches Based on Finite State Machines. In: Introduction to Formal Hardware Verification. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03809-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-03809-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08477-5
Online ISBN: 978-3-662-03809-3
eBook Packages: Springer Book Archive