Design of Asynchronous Circuits Assuming Unbounded Gate Delays
IEEE Transactions on Computers
Parallel program schemata: A mathematical model for parallel computation
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Completely functional asynchronous computational structures
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
| Hi-index | 14.99 |
This note considers the operation of systems composed of interconnected asynchronously operating modules and shows that some such systems may enter "blocking conditions" in which no module can change state. The model considered applies specifically to asynchronous systems in which each module is controlled only by its neighbors, but may also be relevant to other systems such as parallel computational schemes. We also demonstrate a procedure that may speed up computation and we show that the function computed by a given network may depend upon the initial state.