8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)
Oct. 18, 1967 to Oct. 20, 1967
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1967.38
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.
A. D. Friedman, "Universal single transition time asynchronous state assignments," 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS), Texas, 1967, pp. 106-111.