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

Uloženo v:
Podrobná bibliografie
Vydáno v:1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051) s. 45 - 49
Hlavní autoři: Higuchi, H., Somenzi, F.
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 1999
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 during image computation without causing BDD (binary decision diagram) size blowup in the substitution of next state variables with present state variables at the end of image computation. Experimental results show that our approach is more robust in state traversal than the approaches that either unconditionally group variable pairs or never group them.
Bibliografie:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:9780780358324
0780358325
ISSN:1092-3152
DOI:10.1109/ICCAD.1999.810619