Periodic scheduling of marked graphs using balanced binary words - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2012

Periodic scheduling of marked graphs using balanced binary words

(1) , (1)
1

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.

Dates and versions

hal-00764076 , version 1 (12-12-2012)

Identifiers

Cite

Jean-Vivien Millo, Robert de Simone. Periodic scheduling of marked graphs using balanced binary words. Theoretical Computer Science, 2012, 458 (2), pp.113-130. ⟨10.1016/j.tcs.2012.08.012⟩. ⟨hal-00764076⟩
91 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More