Lazy group sifting for efficient symbolic state traversal of FSMs

Proposes lazy group sifting for dynamic variable reordering during state traversal of finite state machines (FSMs). The proposed method relaxes the idea of pairwise grouping of the present state variables and their corresponding next state variables. This is done to produce better variable orderings...

Celý popis

Podrobná bibliografia

Vydané v:	1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051) s. 45 - 49
Hlavní autori:	Higuchi, H., Somenzi, F.
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 1999
Predmet:	Automata Binary decision diagrams Circuit synthesis Circuit testing Flip-flops Laboratories Logic testing Robustness Sequential analysis Sequential circuits
ISBN:	9780780358324, 0780358325
ISSN:	1092-3152
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!