Loading [a11y]/accessibility-menu.js
Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT | IEEE Conference Publication | IEEE Xplore

Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT


Abstract:

The behaviour of asynchronous circuits is often described by signal transition graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...Show More

Abstract:

The behaviour of asynchronous circuits is often described by signal transition graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is deriving equations for logic gates implementing each output signal of the circuit. This is usually done using reachability graphs. In this paper, we avoid constructing the reachability graph of an STG, which can lead to state space explosion, and instead use only the information about causality and structural conflicts between the events involved in a finite and complete prefix of its unfolding. We propose an efficient algorithm for logic synthesis based on the incremental Boolean satisfiability (SAT) approach. Experimental results show that this technique leads not only to huge memory savings when compared with the methods based on reachability graphs, but also to significant speedups in many cases, without affecting the quality of the solution.
Date of Conference: 18-18 June 2004
Date Added to IEEE Xplore: 06 July 2004
Print ISBN:0-7695-2077-4
Conference Location: Hamilton, ON, Canada

References

References is not available for this document.