Computation of prime cubes of a complex boolean function based on BDDs - continuation on probability of time unfolded prime cubes
With decreasing feature size and increasing complexity of integrated circuits, effective tools for verification and testing are in high demand.
When testing large and complex state machines, effective tools for calculating probabilities of future states are often needed.
The PState program calculates these with an adapted form of Binary Desicion Diagrams.
This project is part of an effort to extend this to search for functions to reach these states by extracting prime cube covers of these BDDs.
This report documents my work with the PState program, the adaptation of the cube extraction algorithm, and attempting to unfold the computation over several cycles of a state machine, the problems encountered, and outlines possible ways to solve these challenges.
Place, publisher, year, edition, pages
Institutt for elektronikk og telekommunikasjon , 2013. , 33 p.
IdentifiersURN: urn:nbn:no:ntnu:diva-22712Local ID: ntnudaim:10006OAI: oai:DiVA.org:ntnu-22712DiVA: diva2:651714
Svarstad, Kjetil, Professor