DocumentCode :
298352
Title :
Connectivity and spectral analysis of finite state machines
Author :
Macii, Enrico ; Poncino, Massimo
Volume :
1
fYear :
1994
fDate :
3-5 Aug 1994
Firstpage :
377
Abstract :
Representing finite state systems by means of finite state machines is a common approach in VLSI circuit design. BDD-based algorithms have made possible the manipulation of FSMs with very large state spaces; however, when the representation of the set of reachable states grows too much, the original FSM is no longer manageable as a whole, and it needs to be decomposed into smaller sub-machines. Structural analysis of the circuit from which the FSM has been extracted has shown to be very effective to determine good state variable partitions which induce FSM decomposition for logic synthesis and formal verification applications. In this paper we propose FSM analysis techniques based on connectivity and spectral characteristics of the state machine which take into account the mutual dependency of the state variables, but which are no longer dependent on the structure of the underlying circuit; therefore, they may be used in a context different from sequential logic optimization and FSM verification
Keywords :
VLSI; circuit CAD; finite state machines; formal verification; logic CAD; spectral analysis; state-space methods; BDD-based algorithms; VLSI circuit design; connectivity; finite state machines; formal verification; logic synthesis; mutual dependency; reachable states; spectral analysis; state spaces; state variable partitions; structural analysis; Automata; Boolean functions; Circuit analysis; Circuit synthesis; Data structures; Formal verification; Logic circuits; Spectral analysis; State-space methods; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
Conference_Location :
Lafayette, LA
Print_ISBN :
0-7803-2428-5
Type :
conf
DOI :
10.1109/MWSCAS.1994.519260
Filename :
519260
Link To Document :
بازگشت