Skip to Main content Skip to Navigation
Journal articles

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, Laboratoire I3S - 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Frédéric Mallet Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 11:51:11 AM
Last modification on : Friday, January 21, 2022 - 3:16:55 AM

Links full text




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. ⟨10.1016/j.tcs.2012.08.012⟩. ⟨hal-00764076⟩



Les métriques sont temporairement indisponibles