Computing subsets of equivalence classes for large FSMs

Computing equivalence classes for FSMs has several applications to synthesis and verication 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 stateof-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.

• Type: Conference
• Year: 1995
• Where: EURODAC
• Authors: Gianpiero Cabodi, Stefano Quer, Paolo Camurati
• Keywords: Equivalence Classes, EURODAC 1995, Symbolic Traversal Techniques, Veri Cation Problems, VHDL