Abstract
In this chapter we describe a formal model for the analysis of the behavior of asynchronous circuits modeled by networks in which the delays are inertial and have only upper bounds. The analysis is limited to a single transition: Suppose the network is in a given state and the input is kept constant. We would like to know what is the “outcome” of the transition, i.e., what are the possible states of the network a “long” time after the input change, i.e., after the “transients have died down.” The analysis of the circuit behavior in response to a sequence of input changes can then be carried out as a series of such transition analyses. We postpone the discussion of the response to an input sequence until Chapters 11–13.
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). Up-Bounded-Delay Race Models. In: Asynchronous Circuits. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4210-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4210-9_6
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