Feedback-free circuits in the algebra of transients

  • Authors:

  • Mihaela Gheorghiu;Janusz Brzozowski

  • Affiliations:

  • School of Computer Science, University of Waterloo, Waterloo, ON, Canada;School of Computer Science, University of Waterloo, Waterloo, ON, Canada

  • Venue:
  • CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient simulation algorithm using an algebra of transients for gate circuits was proposed by Brzozowski and Ésik. This algorithm seems capable of predicting all the signal changes that can occur in a circuit under worst-case delay conditions. We verify this claim by comparing simulation with binary analysis. For any feedback-free circuit consisting of 1- and 2-input gates and started in a stable state, we prove that all signal changes predicted by simulation occur in binary analysis, provided that wire delays are taken into account. Two types of finite automata play an important role in our proof.