Résumé de séminaire

Résumé :

Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements. A decomposition algorithm is presented which - in contrast to similar approaches in the literature - is very generally applicable. An interesting aspect in the correctness proof is the use of a bisimulation with angelic nondeterminism.

Références :

Home page : http://www.informatik.uni-augsburg.de/~vogler/

Decomposition in Asynchronous Circuit Design. (with R. Wollowski) Universität Augsburg, Institut für Informatik, Report 2002-5, 2002. http://www.informatik.uni-augsburg.de/forschung/techBerichte/reports/2002-5.html