State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...
Timothy Kam, Tiziano Villa, Robert K. Brayton, Alb...
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
The problem of distinguishing density-independent (DI) from density-dependent (DD) demographic time series is important for understanding the mechanisms that regulate populations ...
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...
Valentin Chimisliu, Christian Schwarzl, Bernhard P...
State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (flip-flops)...