Implicit State Enumeration for FSMs with Datapaths
نویسندگان
چکیده
We show how the classic BDD-based technique of implicit state enumeration for FSMs can be generalized to an automata-based approach for implicit state enumeration of FSMs interacting with datapaths of unbounded width. We present experimental results showing that our automata representation of an unbounded width datapath can be 10x more compact than the BDD representation of the corresponding 32-bit datapath.
منابع مشابه
A FSM Extractor for HDL Description at RTL Level
Due to the increasing complexity of modern circuit designs, HDL based design methodology is getting popular. Because Finite State Machines (FSMs) and datapaths have significantly different properties, dealing them with two different ways is a trend of many CAD tools. However, how to extract FSMs from the original HDL automatically is still a problem. Furthermore, automatic FSM optimization and ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA comprehensive approach to the partial scan problem using implicit state enumeration
This paper presents a novel technique to evaluate the noncontrollability measures of state registers for partial scan design. Our model uses implicit techniques for finite state machine (FSM) traversal to identify noncontrollable state registers. By implicitly enumerating the states of a machine, we accurately evaluate the noncontrollability of flip–flops by determining exactly what values can ...
متن کاملTesting Nondeterministic Finite State Machines with Respect to the Separability Relation
In this paper, we propose a fault model and a method for deriving complete test suites for nondeterministic FSMs with respect to the separability relation. Two FSMs are separable if there exists an input sequence such that the sets of output responses of these FSMs to the sequence do not intersect. In contrast to the well-known reduction and equivalence relations, the separability relation can ...
متن کاملSolving QBF by Clause Selection
Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum satisfiability and model based diagnosis, among others. This paper exploits enumeration of implicit hitting sets in the context of Quantified Boolean Formulas (QBF). The paper starts by developing a simple algorithm for QBF with two levels of quantification, which is shown t...
متن کامل