用平衡二进制字实现标记图的周期调度
Periodic scheduling of marked graphs using balanced binary words
摘要：
本报告提出了一种算法，静态调度活的和强连接的标记图（MG）。所提出的算法计算最佳执行的执行率是最大的地方大小是最小的。所提出的算法提供了转换时间表表示为二进制字。选择这些词是为了平衡。本文的贡献是所提出的算法本身以及任何MG的最佳执行的表征。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
