A characterization of some asnychronous state assignments

A theorem analogous to the information flow theorems1 of synchronous sequential networks is proven for one class of asynchronous sequential networks. This theorem is then shown to lead to a characterization of the valid state assignments for this class of asynchronous circuits. Namely, necessary and sufficient conditions are determined for when a set of two block partitions will define a critical race-free, minimum transition time6 state assignment for a given asynchronous flow table. This result is also shown to be equivalent to a previous result of Tracey's.6 A second theorem characterizes to a limited extent a second class of asynchronous networks.