Sequential equivalence checking without state space traversal

Abstract

Because general algorithms for sequential equivalence checking require a state space traversal of the product machine, they are computationally expensive. In this paper, we present a new method for sequential equivalence checking which utilizes functionally equivalent signals to prove the equivalence of both circuits, thereby avoiding the state space traversal. The effectiveness of the proposed method is confirmed by experimental results on retimed and optimized ISCAS'89 benchmarks.

5 Figures and Tables

Statistics

0510'99'01'03'05'07'09'11'13'15'17
Citations per Year

107 Citations

Semantic Scholar estimates that this publication has 107 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Eijk1998SequentialEC, title={Sequential equivalence checking without state space traversal}, author={C. A. J. van Eijk}, year={1998} }