Computation by asynchronously updating cellular automata
We implement three primitive operators on the cellular automaton from which any arbitrary delay insensitive circuit can be constructed, and show how to connect the operators such that collisions of crossing signals are avoided. This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications.The method is based on a structural encoding of the system in such a way that a circuit implementation is always guaranteed.We implement three primitive operators on the cellular automaton from which any arbitrary delay-insensitive circuit can be constructed and show how to connect the operators such that collisions of crossing signals are avoided.DOI: 10.1023/B: JOSS.0000003112.54283The cellular automaton uses a random sequential updating scheme, meaning that at each time step one cell is randomly selected for update.The set of transformations is derived from previous work on Petri net synthesis.
The two-dimensional cellular automaton employs a Moore neighborhood and 85 totalistic transition rules describing the asynchronous interactions between the cells.Moreover, a set of transformations is presented for the subcla ..." This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications.Moreover, a set of transformations is presented for the subclass of Free-Choice Petri nets that enables the exploration of different solutions.In very large circuits, such as modern microprocessors, the distribution of th... Such a scheme requires not only an increased number of cell states, but also the simulation of a global synchronization mechanism. A known method to compute on an asynchronously updating cellular automaton is the simulation of a synchronous computing model on it.Asynchronous systems tend to use synchronization only on a local scale—if they use it at all.