Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

Authors:
Victor Khomenko;Agnes Madalinski;Alex Yakovlev
Affiliations:
(Correspd.) School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom;School of Electrical, Electronic and Computer Engineering, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom. {Victor.Khomenko,A.A.Madalinski,Alex.Yakovlev}@ncl.ac.uk;School of Electrical, Electronic and Computer Engineering, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom. {Victor.Khomenko,A.A.Madalinski,Alex.Yakovlev}@ncl.ac.uk
Venue:
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Year:
2008

Citing 15
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Modeling concurrency with partial orders

International Journal of Parallel Programming
A general state graph transformation framework for asynchronous synthesis

EURO-DAC '94 Proceedings of the conference on European design automation
What is the cost of delay insensitivity?

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Analyzing Specifications for Delay-Insensitive Circuits

ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Towards Asynchronous A-D Conversion

ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
An Analysis of Determinacy Using a Trace-Theoretic Model of Asynchronous Circuits

ASYNC '03 Proceedings of the 9th International Symposium on Asynchronous Circuits and Systems
Trace theory for automatic hierarchical verification of speed-independent circuits

Trace theory for automatic hierarchical verification of speed-independent circuits
State encoding of large asynchronous controllers

Proceedings of the 43rd annual Design Automation Conference
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Behaviour-preserving transition insertions in unfolding prefixes

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT

Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
A structural encoding technique for the synthesis of asynchronous circuits

Fundamenta Informaticae - Application of Concurrency to System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

A combined framework for the resolution of encoding conflicts in STG unfoldings is presented, which extends previouswork by incorporating concurrency reduction in addition to signal insertion. Furthermore, a novel validity condition is proposed to justify these transformations. The method has been implemented in the CONFRES tool and applied to a number of case studies. The experimental results show that the combined framework enlarges the design space and allows for better exploration of the speed/area tradeoff.