Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs

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
$31 $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)
Kettle, N. ; Portcullis Comput. Security Ltd., Pinner ; King, A.

Detecting symmetries have many applications in logic synthesis, which include, among other things, technology mapping, deciding equivalence of Boolean functions when the input correspondence is unknown, and finding support-reducing bound sets. Mishchenko showed how to efficiently detect symmetries in reduced ordered binary decision diagrams (ROBDDs) without the need for checking equivalence of all cofactor pairs. This work resulted in practical algorithms for detecting classical and generalized symmetries. Both the classical and generalized symmetry-detection algorithms are monolithic in the sense that they only return a meaningful answer when they are left to run to completion. In this paper, we present anytime algorithms for detecting both classical and generalized symmetries, which output pairs of symmetric variables until a prescribed time bound is exceeded. These anytime algorithms are complete in that, given sufficient time, they are guaranteed to find all symmetric pairs. Anytime generality is not gained at the expense of efficiency because this approach requires only very modest data-structure support and offers unique opportunities for optimization, so that the resulting algorithms are competitive with their monolithic counterparts.

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:27 ,  Issue: 4 )