Combining process algebras and Petri nets for the specification and synthesis of asynchronous circuits

Improved Parallel Composition of Labelled Petri Nets

“…One operation where implicit places matter is transition contraction, [15] which is a crucial part of the resynthesis approach [1,8,11]. The idea is to hide the internal communication between the components (by labelling the corresponding transitions as 'dummy' -they correspond to signals a and b in our example), contract as many of these dummy transitions as possible (whereby reducing the size of the STG), and resynthesise the obtained STG as a circuit (which is often smaller than the original circuit due to removal of some signals).…”

Logic Synthesis of Handshake Components Using Structural Clustering Techniques

“…The approach can be considered a follow-up of previous work [15,17,5,8,19], with the differences listed below:…”

“…State-based methods are used in [17,5,8], thus suffering from the state space explosion problem. Hence their application is limited to small specifications.…”

“…Those clusters grow as far as the induced Petri net composition of the selected components belongs to a class for which structural methods perform well. A blind clustering is used in the Petri net-based approaches [15,17,5], often deriving unrestricted clusters that synthesis methods can not handle.…”

Synthesis of Asynchronous Hardware from Petri Nets

“…Some local 'peephole' optimisation was introduced at the level of handshake circuit description. Petri nets were used for that in the form of Signal Transition Graphs (STGs) and their composition, with subsequent synthesis using the Petrify tool [52,18]. Similar sort of approach is currently followed by the designers of the Balsa flow, where the role of peephole optimisation tools is played by the FSM-based synthesis tool Minimalist [12].…”