Published May 29, 2009
| Accepted Version
Book Section - Chapter
Open
A Necessary and Sufficient Timing Assumption for Speed-Independent Circuits
Chicago
Abstract
This paper presents a proof that the adversary path timing assumption is both necessary and sufficient for correct SI circuit operation. This assumption requires that the delay of a wire on one branch of a fork be less than the delay through a gate sequence beginning at another branch in the same fork. Both the definition of the timing assumption and the proof build on a general, formal notion of computation given with respect to production rule sets. This underlying framework can be used for a variety of proof efforts or as a basis for defining other useful notions involving asynchronous computation.
Additional Information
© 2009 IEEE. Acknowledgment is due to Chris J. Myers, Piyush Prakash, and to the members of our research groups for their excellent comments and insights. The research described in this paper is in part supported by a grant from the National Science Foundation.Attached Files
Accepted Version - Keller2009p8391Async_2009_15Th_Ieee_International_Symposium_On_Asynchronous_Circuits_And_Systems.pdf
Files
Keller2009p8391Async_2009_15Th_Ieee_International_Symposium_On_Asynchronous_Circuits_And_Systems.pdf
Files
(245.0 kB)
Name | Size | Download all |
---|---|---|
Keller2009p8391Async_2009_15Th_Ieee_International_Symposium_On_Asynchronous_Circuits_And_Systems.pdf
md5:0ef92bd95aa760b47452da617ea935db
|
245.0 kB | Preview Download |
Additional details
- Eprint ID
- 18164
- Resolver ID
- CaltechAUTHORS:20100506-101621122
- NSF
- Created
-
2010-05-14Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Other Numbering System Name
- Computer Science Technical Reports
- Other Numbering System Identifier
- 2009.001