Proceedings International Conference on Computer Design. VLSI in Computers and Processors
DOI: 10.1109/iccd.1996.563524
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing FSM traversal by temporary re-encoding

Abstract: Synthesis and optimization of large finite-state machines has improved dramatically over the last f e w years with the introduction and rapid improvement of symbolic-state manipulation techniques. T h e algorithms efficiently visit each reachable state in the machine while computing and storing information about these states. We propose a new technique f o r imp-roving the efficacy of traversal algorithms: re-encoding the states of the machine to moTe efficiently represent state sets o r state transitions, or … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 10 publications
(5 reference statements)
0
2
0
Order By: Relevance
“…26 The overall tool includes all recently published dynamic reordering techniques and a traversal method based on a partitioned and clustered transition relation with sorting heuristics and other optimizations. 6,23,27,28,29 Moreover, we also use some optimizations reported in Cabodi et al 20 We use this tool both without and with the improved method based on partitioning: in the former case we consider our tool as 'state-of-the-art', and it servers the purpose of measuring the improvement obtained with our novel technique. Our experiments run on a 200 MHz DEC Alpha with a 256 Mbyte main memory.…”
Section: Resultsmentioning
confidence: 99%
“…26 The overall tool includes all recently published dynamic reordering techniques and a traversal method based on a partitioned and clustered transition relation with sorting heuristics and other optimizations. 6,23,27,28,29 Moreover, we also use some optimizations reported in Cabodi et al 20 We use this tool both without and with the improved method based on partitioning: in the former case we consider our tool as 'state-of-the-art', and it servers the purpose of measuring the improvement obtained with our novel technique. Our experiments run on a 200 MHz DEC Alpha with a 256 Mbyte main memory.…”
Section: Resultsmentioning
confidence: 99%
“…26 The overall tool includes all recently published dynamic reordering techniques and a traversal method based on a partitioned and clustered transition relation with sorting heuristics and other optimizations. 6,23,27,28,29 Moreover, we also use some optimizations reported in Cabodi et al 20 We use this tool both without and with the improved method based on partitioning: in the former case we consider our tool as 'state-of-the-art', and it servers the purpose of measuring the improvement obtained with our novel technique.…”
Section: Resultsmentioning
confidence: 99%