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...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon
2013
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-22712 |