Output details
11 - Computer Science and Informatics
Newcastle University
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
<01> This paper presents the first fully automatic technique for resolving encoding conflicts in the context of asynchronous circuits design that takes advantage of the partial-order view of concurrency and state-of-art SAT solvers. The technique alleviates the state space explosion and thus considerably increases the efficiency. The technique has been implemented in the MPSAT tool, and experiments show significant improvements over the state space based approach in terms of runtime and memory consumption, as well as improvements in the quality of the resulting circuits. This was an important outcome of Khomenko's RAEng/EPSRC fellowship (EP/C53400X/1).