Abstract
The race analysis algorithms and the behaviors introduced so far in this book all use the tacit assumption that the states of a network are represented explicitly. Since the state space grows exponentially with the size of the network, such a representation can only be used for relatively small circuits. In this chapter we consider representing states and other similar objects symbolically.
This is a preview of subscription content, log in via an institution to check access.
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
© 1995 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Brzozowski, J.A., Seger, CJ.H. (1995). Symbolic Analysis. In: Asynchronous Circuits. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4210-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4210-9_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8698-1
Online ISBN: 978-1-4612-4210-9
eBook Packages: Springer Book Archive