Periodic scheduling of marked graphs using balanced binary words

Jean-Vivien Millo 1, * Robert de Simone 1
* Corresponding author
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorithm itself along with the characterization of the best execution of any MG.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00672606
Contributor : Jean-Vivien Millo <>
Submitted on : Wednesday, February 22, 2012 - 2:07:19 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Friday, November 23, 2012 - 2:25:15 PM

Files

RR-7891.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00672606, version 1
  • ARXIV : 1202.4912

Citation

Jean-Vivien Millo, Robert de Simone. Periodic scheduling of marked graphs using balanced binary words. [Research Report] RR-7891, INRIA. 2012, pp.33. ⟨hal-00672606⟩

Share

Metrics

Record views

476

Files downloads

282