Simulation of gate circuits in the algebra of transients
Janusz Brzozowski, Mihaela Gheorghiu · 2002
Abstract. We study simulation of gate circuits in algebra recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In, gates process transients instead of s and s. Simulation in is capable of counting signal changes, and detecting hazards. We study two simulation algorithms: a general one, A, that works with any state, and Ã, that applies if the initial state is stable. We show that the two algorithms agree in the stable case. We prove the sufficiency of the simulation: all signal changes occurring in binary analysis are also predicted by Algorithm A. 1