Optimal scheduling of finite-state machines
Tzu-Chieh Yen, Marilyn C. Wolf · 2002
The paper describes an algorithm for solving scheduling problems which contain multiple, interlocking cycles, such as scheduling constraints in state transition graphs. This algorithm is based on previous work on toroidal compaction but introduces three significant improvements: it allows the designer to use upper bound or equality constraints; it does not require an initial feasible solution; and it can handle multiple loops and conditional branches in the constraint system. Experimental results demonstrate the algorithm's effectiveness.>