Browse by author
Lookup NU author(s): Dr Victor Khomenko
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 the set and reset covers for the state-holding elements implementing each output signal of the circuit. The derived covers must satisfy certain correctness constraints, in particular the Monotonic Cover condition must hold for the standard C implementation. The covers are usually derived using state graphs. In this paper, we avoid constructing the state 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 deriving the set and reset covers of gC elements and standard C implementation 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 state graphs, but also to significant speedups in many cases, without affecting the quality of the solution.
Author(s): Khomenko V
Publication type: Report
Publication status: Published
Series Title: School of Computing Science Technical Report Series
Year: 2005
Pages: 17
Print publication date: 01/09/2005
Source Publication Date: September 2005
Report Number: 930
Institution: School of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/930.pdf
