Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Events and conditions: introduction
Record of the Project MAC conference on concurrent systems and parallel computation
Record of the Project MAC conference on concurrent systems and parallel computation
On the models for designing VLSI asynchronous digital systems
Integration, the VLSI Journal
| Hi-index | 0.00 |
This paper proceeds from a simple analogy between the Huffman primitive flow table for asynchronous sequential machines and Petri nets. This analogy is used to generalize the Huffman flow table as a special form of Petri net, called an m-net, which allows one to design asynchronous machines which exhibit concurrent behavior with respect to their inputs, outputs, and (total) internal state. The problem of "simultaneous" input changes is identified as requiring either arbitration or concurrency. A design example is given, which illustrates some of the advantages and nearly all the difficulties of this technique.