-
Periodic scheduling of marked graphs using balanced binary words
International audience -
Periodic scheduling of marked graphs using balanced binary words
This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the... -
Another glance at Relay Stations in Latency-Insensitive Designs
We revisit the formal modeling of relay stations, which are specific connection elements used in the theory of Latency-Insensitive Design of...
