This pap er presents a novel optimization algorithm for FSM networks that relies on sequential test generation and redun- dancy removal. The implementation of the prop osed approach, which is based on the exploitation of input don't care sequences through regular language intersection, is fully symb olic. Exp er- imental results, obtained on a large set of standard b enchmarks, improve over the ones of state-of-the-art metho ds
Symbolic Optimization of FSM Networks based on Sequential ATPG Techniques
FUMMI, Franco;
1996-01-01
Abstract
This pap er presents a novel optimization algorithm for FSM networks that relies on sequential test generation and redun- dancy removal. The implementation of the prop osed approach, which is based on the exploitation of input don't care sequences through regular language intersection, is fully symb olic. Exp er- imental results, obtained on a large set of standard b enchmarks, improve over the ones of state-of-the-art metho ds
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
