Abstract
As we have seen in Chapter 6, the race analysis methods—that examine all possible successors of a given state—are computationally intractable. We now describe a method that is quite efficient and produces results that can be viewed as a summary of the results produced by the multiple-winner methods. For many purposes, such summarized results are sufficient.
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.
Similar content being viewed by others
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). Ternary Simulation. In: Asynchronous Circuits. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4210-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4210-9_7
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