G. Swamy, V. Singhal, and R. Brayton, "Incremental methods for FSM traversal," ACM/IEEE International Workshop on Logic Synthesis, pp. 3.7--3.15, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....fanins, say4;5or6. In our current implementation, we perform the modified reachable state traversal for each internal node. This could be very time consuming. We are currently investigating the possibility of using the reachable state approximation [9, 19] and incremental state traversal method [24] to speed up the state traversal. Acknowledgements This work was supported under NSF grant MIP 9419119 and MICRO Fujitsu. ....

G. Swamy, V. Singhal, and R. Brayton, "Incremental methods for FSM traversal," ACM/IEEE International Workshop on Logic Synthesis, pp. 3.7--3.15, 1995.

....information can be computed, and updated in an implicit framework using BDD s. We present some results in section 5. Finally, we conclude our paper by presenting our conclusions, and future directions for this work. For brevity, details of proofs of theorems have been omitted; they may be found in [7]. 2 Definitions Definition 1 Finite State Machine: A finite state machine or finite automaton M is a 5 tuple (Q; Sigma; Gamma; T ; I) where ffl Q is a finite set of states ffl Sigma is a finite set of input values ffl Gamma is a finite set of output values ffl T ae Q Theta Sigma Theta ....

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal," Tech. Rep. UCB/ERL M95/, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, 1995.

....of a semi canonical form, but our form is simpler (and hence faster) at the expense of some precision. Also, we deal with more general multi valued functions [6] rather than just binary. The techniques presented here can be used to drive the incremental verification algorithms of Swamy et a. l [7] [8] and Sokolosky et al. 9] These use information about the similarities between two designs to speed up the verification process. 3 Table Matching The nodes in our networkshave discrete valued functions (a generalization of boolean functions) associated with them. These are represented in ....

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal," in Proc. Intl. Conf. on Computer Design, pp. 590--595, Oct. 1995.

....algorithms for reachability; how this information can be computed, and updated in an implicit framework using BDD s. We present some results in section 5. We present future directions for this work in section 6. For brevity, details of proofs of theorems have been omitted; they may be found in [7]. 2 Definitions Definition 1 Finite State Machine: A finite state machine or finite automaton M is a 5 tuple (Q; S; G; T; I) where ffl Q is a finite set of states ffl S is a finite set of input values ffl G is a finite set of output values ffl T ae Q Theta S Theta G Theta Q is the ....

....relation T new . Using T new and T , we create two sets: sub and add. sub consists of all deleted transitions, which were removed in T new and add consists of all transitions added in T new . The exact computation of add and sub under different methods for changing input, is described in [7]. 4.2 Spanning Tree Incremental Algorithm In this section we deal with an incremental algorithm, which chooses P (x; y) to be a spanning tree that can generated during the course of reachability computations. 4.2.1 Computing the spanning tree The implicit reachability algorithm described in ....

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal," Tech. Rep. UCB/ERL M95/, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, 1995.

....information can be computed, and updated in an implicit framework using BDDs. We present some results in section 5. Finally, we conclude our paper by presenting our conclusions, and future directions for this work. For brevity, details of proofs of theorems have been omitted; they may be found in [7]. 2 Definitions Definition 1 Finite State Machine: A finite state machine or finite automaton M is a 5 tuple (Q; Sigma; Gamma; T ; I) where ffl Q is a finite set of states ffl Sigma is a finite set of input values ffl Gamma is a finite set of output values ffl T ae Q Theta Sigma Theta ....

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal," Tech. Rep. UCB/ERL M95/, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, 1995.

....described to get more efficient verification. A similar incremental design flow can be proposed for synthesis of the circuits. There is no doubt that such an approach to CAD is more suited to fitting in with the way IC design is done. Succinct versions of this work can be found in [49] 50] [84], 85] 86] 155 ....

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal, " in Proc. Intl. Workshop on Logic Synthesis, (Tahoe), May 1995. 163

....a semi canonical form, but our form is simpler (and hence faster) at the expense of some precision. Also, we deal with more general multi valued functions [48] rather than just binary. The techniques presented here can be used to drive the incremental verification algorithms of Swamy et al. [49] [50] and Sokolosky et al. [32] These use information about the similarities between two designs to speed up the verification process. This chapter is organized as follows. Section 3.2 contains exact and heuristic solutions to the network (structural) matching problem. We present both an exact ....

....graph of the reachable states, to compute a new spanning tree, which represents the new reachable states. In this chapter we will examine three different alternate representations for the reached state set and traversal information. 50 A more succinct version of this work can be found in [50]. 4.2 Terminology for FSM Traversal We have defined a Finite State Machine, its states, inputs, outputs, transition relation T (x; i; o; y) and initial states I(x) in Chapter 2. Using those definitions, we shall discuss how to compute the reachable states of the finite state machine in this ....

[Article contains additional citation context not shown here]

G. M. Swamy, V. Singhal, and R. K. Brayton, "Incremental methods for Fsm Traversal, " in Proc. Intl. Conf. on Computer Design, pp. 590--595, Oct. 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC