Periodic scheduling of marked graphs using balanced binary words

Jean-Vivien Millo 1 Robert De Simone 1
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, COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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 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 are the proposed algorithm itself along with the characterization of the best execution of any marked graph.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2012, 458 (2), pp.113-130. <http://www.sciencedirect.com/science/article/pii/S0304397512007852>. <10.1016/j.tcs.2012.08.012>
Liste complète des métadonnées

https://hal.inria.fr/hal-00764076
Contributeur : Frédéric Mallet <>
Soumis le : mercredi 12 décembre 2012 - 11:51:11
Dernière modification le : lundi 5 octobre 2015 - 16:58:16

Identifiants

Collections

Citation

Jean-Vivien Millo, Robert De Simone. Periodic scheduling of marked graphs using balanced binary words. Theoretical Computer Science, Elsevier, 2012, 458 (2), pp.113-130. <http://www.sciencedirect.com/science/article/pii/S0304397512007852>. <10.1016/j.tcs.2012.08.012>. <hal-00764076>

Partager

Métriques

Consultations de la notice

135