Output details
11 - Computer Science and Informatics
Newcastle University
Article title
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Type
D - Journal article
Title of journal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Article number
-
Volume number
17
Issue number
7
First page of article
855
ISSN of journal
1557-9999
Year of publication
2009
Number of additional authors
0
Additional information
<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).
Interdisciplinary
Yes
Cross-referral requested
-
Research group
B - Concurrent Asynchronous Systems
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
