Input don't care sequences in FSM networks
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
We present an approach to computer all input don''t care sequences for a component in an FSM network with an arbitrary topology. In a cascade FSM network, Kim and Newborn''s (K-N) procedure [13] exactly computes all input don''t case sequences for the driven machine. We demonstrate that this problem can be reduced to one for cascade circuit. This reduction uses the notion of an abstract driving machine. In some cases, the exact computation and exploitation of these sequences may be too expensive. We propose methods to computer subsets of input don''t care sequences. We discuss the implementation of these algorithms using implicit methods. We also present approximate methods for managing the complexity of large FSM networks. Finally, we give some preliminary results on small networks.