Computing subsets of equivalence classes for large FSMs

Computing equivalence classes for FSMs has several applications to synthesis and verification problems. Symbolic traversal techniques are applicable to medium-small circuits. This paper extends their use to large FSMs by means of cofactor-based enhancements to the state-of-the-art approaches and of underestimations of equivalence classes. The key to success is pruning the search space by constraining it. Experimental results on some of the larger ISCAS'89 and MCNC circuits show its applicability.

[1]  A. Richard Newton,et al.  Don't care minimization of multi-level sequential logic networks , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Enrico Macii,et al.  Algorithms for Approximate FSM Traversal , 1993, 30th ACM/IEEE Design Automation Conference.

[3]  Gianpiero Cabodi,et al.  Symbolic exploration of large circuits with enhanced forward/backward traversals , 1994, EURO-DAC '94.

[4]  A. Richard Newton,et al.  Implicit manipulation of equivalence classes using binary decision diagrams , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[5]  Thomas Tamisier.  Computing the observable equivalence relation of a finite state machine , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).