Periodic scheduling of marked graphs using balanced binary words

JV Millo, R De Simone - Theoretical Computer Science, 2012 - Elsevier
This paper presents an algorithm to statically schedule live and strongly connected Marked
Graphs. The proposed algorithm computes the best execution where the execution rate is …

Static scheduling of latency insensitive designs with Lucy-n

L Mandel, F Plateau, M Pouzet - 2011 Formal Methods in …, 2011 - ieeexplore.ieee.org
Lucy-n is a data-flow programming language similar to Lustre extended with a buffer
operator. It is based on the n-synchronous model which was initially introduced for …

Rethinking of I/O-automata composition

S Chabane, R Ameur-Boulifa… - 2017 Forum on …, 2017 - ieeexplore.ieee.org
The necessity of handling the increasing complexity of embedded systems has led to the
growth of reuse-based design. At the same time, the systems must still satisfy strict …

Formal methods for intellectual property composition across synchronization domains

SM Suhaib - 2007 - vtechworks.lib.vt.edu
A significant part of the System-on-a-Chip (SoC) design problem is in the correct
composition of intellectual property (IP) blocks. Ever increasing clock frequencies make it …

[PDF][PDF] LISTE des PUBLICATIONS

S Moll, I Szanto - metabolism, 2007 - hug.ch
Date Prepared: Nov Page 1 LISTE des PUBLICATIONS 1. Tatjana Sajic, Emmanuel Varesio,
Ildiko Szanto, Gérard Hopfgartner: Comparison of fractionation strategies for offline 2D-LC-MS/MS …

[CITATION][C] Modele n-synchrone pour la programmation de réseaux de Kahna mémoire bornée

MMJP Allouche, G Berry, M Duranton, N Halbwachs