Universal single transition time asynchronous state assignments

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.