Synthesis Without State Explosion -- from concurrent processes to netlists

Add to your list(s) Download to your calendar using vCal

• Dennis Fury (Plumstead Publishing)
• Monday 18 November 2019, 16:00-17:00
• Level 9 Seminar Room, EEE Dept..

If you have a question about this talk, please contact George A Constantinides.

This presentation will report on a recursive algorithm for digital circuit synthesis that substantially mitigates the so called state explosion problem. Starting from a readily intuitive process-style behavioral description and using Petri nets as an intermediate representation, we limit state enumeration to an adjustable constant cost bound throughout the transformation to the netlist form. Prior related work has depended on restrictive assumptions such as circuits conforming to free-choice Petri net models, but the proposed method is fully general. Attendees will also be treated to a whirlwind tour of delay insensitive circuit design and analysis sufficient for an understanding of this topic.

keywords: Petri nets, direct mapping synthesis, delay insensitive

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Level 9 Seminar Room, EEE Dept.

Note that ex-directory lists are not shown.