DocumentCode
3263365
Title
Universal single transition time asynchronous state assignments
Author
Friedman, Arthur D.
fYear
1967
fDate
18-20 Oct. 1967
Firstpage
106
Lastpage
111
Abstract
In this paper we consider the problem of deriving general bounds on the number of state variables required to realize an asynchronous flow table as a function of n, the number of states of the flow table for Single Transition Time (STT) assignments in which all variables which must change in a given transition are allowed to change simultaneously in a noncritical race.
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1967. SWAT 1967. IEEE Conference Record of the Eighth Annual Symposium on
Conference_Location
Austin, TX, USA
Type
conf
DOI
10.1109/FOCS.1967.38
Filename
5397214
Link To Document