Abstract
Two questions naturally arise in connection with the analysis of a transition caused by an input change: 1) Will the network eventually reach a unique (binary) stable state? 2) Will the network be in a unique (binary) state at time t? We call the first question the “stable-state reachability” (SSR) problem and the second the “limited reachability” (LR) problem. Both questions can be answered by using the race analysis algorithms presented in earlier chapters. Some of these algorithms are highly efficient, whereas others appear to require time exponential in the size of the network to be analyzed. In this chapter we explore the inherent computational complexity of these analysis problems. We assume the reader is familiar with the standard terminology for NP-completeness, as described in [55]. The work given here is based mainly on [122, 123].
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). Complexity of Race Analysis. In: Asynchronous Circuits. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4210-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4210-9_9
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