×

Simulation of gate circuits in the algebra of transients. (English) Zbl 1033.94568

Champarnaud, Jean-Marc (ed.) et al., Implementation and application of automata. 7th international conference, CIAA 2002, Tours, France, July 3–5, 2002. Revised papers. Berlin: Springer (ISBN 3-540-40391-4/pbk). Lect. Notes Comput. Sci. 2608, 57-66 (2003).
Summary: We study simulation of gate circuits in an algebra \(C\) recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In \(C\), gates process transients instead of 0s and 1s. Simulation in \(C\) is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one, A, which 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.
For the entire collection see [Zbl 1017.00032].

MSC:

94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: Link