A Programming Approach to the Design of Asynchronous Logic Blocks
Concurrency and Hardware Design, Advances in Petri Nets
Synthesis of Reactive Systems: Application to Asynchronous Circuit Design
Concurrency and Hardware Design, Advances in Petri Nets
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
| Hi-index | 0.00 |
This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is base on a structural encoding of the system in such a way that a circuit implementation is always guaranteed. Moreover, a set of transformations is presented for the subclass of Free-Choice Petri nets that enables the exploration of different solutions. All transformations preserve the property of free-choiceness, thus enabling the use of structural methods for the synthesis of asynchronous circuits. Preliminary experimental results indicate that the quality of the circuits is comparable to that obtained by methods that require an exhaustive enumeration of the state space. This novel synthesis method opens the door to the synthesis of large control specifications generate from hardware description languages.