Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876349 | Theoretical Computer Science | 2012 | 18 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jean-Vivien Millo, Robert de Simone,