Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
The maximum set of permissible behaviors for FSM networks
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Modeling hierarchical combinational circuits
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Sequential Circuit Design Using Synthesis and Optimization
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Hierarchical optimization of asynchronous circuits
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Multi-level logic optimization of FSM networks
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Possibilities of using protocol converters for NIR system construction
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Synchronous designs are often described and implemented hierarchically as a network of interacting finite state machines. When the individual components are synthesized and implemented separately, it is desirable to take into account the degrees of freedom that arise from the interactions with the other components and from the specification. Specifically, we consider the problem of finding the complete set of implementations that can be correctly substituted for a component in a system without changing the behavior of the total system. In this paper, a synchronous trace set model is proposed to tackle this problem. The unambiguous way in which this model describes synchronous behavior provides us with a general method to model interacting finite state machines. We show that a single synchronous trace set can be used to characterize all possible substitutions in a correct substitution problem. We give a necessary notion of progress that permits us to choose a correct one from this set, or to show that no solution exists. We provide results of an implicit implementation of our approach applied to benchmarks ranging from small to very large state machines. These results show the feasibility of the proposed methods.