By Topic

Digital circuit verification using partially-ordered state models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. E. Bryant ; Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA ; C. -J. H. Seger

Many aspects of digital circuit operation can be efficiently verified by simulating circuit operation over “weakened” state values. This technique has long been practiced with logic simulators, using the value X to indicate a signal that could be either 0 or 1. This concept can be formally extended to a wider class of circuit models and signal values, yielding lattice-structured state domains. For more precise modeling of circuit operation, these values can be encoded in binary and hence represented symbolically as ordered binary decision diagrams. The net result is a tool for formal verification that can apply a hybrid of symbolic and partially-ordered evaluation

Published in:

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

Date of Conference:

25-27 May 1994