Definite Asynchronous Sequential Circuits
IEEE Transactions on Computers
Iteratively Realized Sequential Circuits
IEEE Transactions on Computers
A cellular structure for sequential networks
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Is the Die Cast for the Token Game?
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Synthesis of Reactive Systems: Application to Asynchronous Circuit Design
Concurrency and Hardware Design, Advances in Petri Nets
A Totally Self-Checking 1-Out-of-3 Checker
IEEE Transactions on Computers
Serialized asynchronous links for NoC
Proceedings of the conference on Design, automation and test in Europe
A structural encoding technique for the synthesis of asynchronous circuits
Fundamenta Informaticae - Application of Concurrency to System Design
Design and test of self-checking asynchronous control circuit
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
| Hi-index | 14.99 |
An universal cell (CUSA) permits one to realize any asynchronous automaton by associating such a cell with a state and a connection with a transition. There is no internal variable assignment and all kinds of hazards are avoided. In the first part of the paper we shall present the principle of the CUSA and the synthesis method using flow tables. It is an original method which enables one to reduce the number of cells and useful connections. In the second part, the method is adapted to a synthesis from a flow graph. In this graph, a node is associated with a state, not necessarily a total state, and a branch with a connection. This synthesis method is easy and systematic. CUSA are now being produced by industry and are available as IC's.