We study simulation of gate circuits in the infinite algebra oftransients recently introduced by Brzozowski and Ésik. A transientis a word consisting of alternating 0s and 1s; it represents achanging signal. In the algebra of transients, gates processtransients instead of 0s and 1s. Simulation in this algebra iscapable of counting signal changes and detecting hazards. We studytwo simulation algorithms: a general one that works with any initialstate, and a special one that applies only if the initial state isstable. We show that the two algorithms agree in the stable case. Wealso show that the general algorithm is insensitive to the removal ofstate variables that are not feedback variables. We prove thesufficiency of simulation: all signal changes occurring in binaryanalysis are predicted by the general algorithm. Finally, we showthat simulation can be more pessimistic than binary analysis, if wiredelays are not taken into account. We propose a circuit model that weconjecture to be sufficient for proving the equivalence of simulationand binary analysis for feedback-free circuits.
