Structural FSM traversal

Authors:
D. Stoffel;M. Wedler;P. Warkentin;W. Kunz
Affiliations:
Dept. of Electr. Eng. & Inf. Technol., Univ. of Kaiserslautern, Germany;-;-;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 6

Utilizing don't care states in SAT-based bounded sequential problems

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states

Proceedings of the conference on Design, automation and test in Europe
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Compositional verification of retiming and sequential optimizations

Proceedings of the 45th annual Design Automation Conference
A compositional approach for equivalence checking of sequential circuits with unknown reset state and overlapping partitions

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Removing overhead from high-level interfaces

Proceedings of the 49th Annual Design Automation Conference

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper discusses a "structural" technique for traversing the state space of a finite state machine (FSM) and its application to equivalence checking of sequential circuits. The key ingredient to a state-space traversal is a data structure to represent state sets. In structural FSM, traversal-state sets are represented noncanonically and implicitly as gate netlists. First, we present an exact algorithm, which is based on an iterative expansion of the FSM into time frames and a network-decomposition procedure serving the same purpose as an existential quantification operation. Then, we discuss approximative algorithms for the application of structural FSM traversal to sequential equivalence checking. We theoretically analyze the properties of the exact as well as the approximative algorithms. Finally, we give details on the implementation of a sequential equivalence checker and present experimental results that demonstrate the effectiveness of the proposed approach for equivalence checking of optimized and retimed circuits.