A dynamic model for the state assignment problem

• Main Authors: Martinez, M., Avedillo, M. J., Quintana, J. M., Huertas, J. L.
• Format: Conference Proceeding
• Language: English
• Subjects: Computer systems organization > Dependable and fault-tolerant systems and networks; Computing methodologies > Modeling and simulation; General and reference > Cross-computing tools and techniques > Performance; Hardware > Electronic design automation > Modeling and parameter extraction; Networks > Network performance evaluation
• DOI: 10.5555/368058.368431

Traditionally, state assignment algorithms follow the two-step strategy of first constraint generation and secondly constraint-guided encoding. There are well known drawbacks in both currently used models for constraint generation. Approaches following the input model generate face constraints without taking into account the sharing of logic among next state lines. Approaches following the input-output model generate face constraints for a priori determined set of dominance/disjunctive relations among the codes of the states which may not hold in final encoding. To overcome these limitations, we propose a dynamic input model which implements both above cited steps concurrently. The dynamic constraints are of the face type but they are generated during the encoding process and so take advantage of actual relations among partial codes. A general algorithm based on this model and which can target two-level as well as multiple-level implementations is described. Results obtained with the algorithm on the IWLS'93 machines are shown and they compare favorably with standard tools.