Sciweavers

2 search results - page 1 / 1
» Using complete-1-distinguishability for FSM equivalence chec...
Sort
View
ICCAD
1996
IEEE
73views Hardware» more  ICCAD 1996»
13 years 9 months ago
Using complete-1-distinguishability for FSM equivalence checking
Pranav Ashar, Aarti Gupta, Sharad Malik
FMSD
1998
60views more  FMSD 1998»
13 years 4 months ago
The General Product Machine: a New Model for Symbolic FSM Traversal
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Pa...