Home › Description

K-PASSA stands for "K-Periodic Asap Static Schedule Analyser". K-PASSA is for modeling and analysing Marked Graph. It implements the equalization process presented in Julien Boucaron's thesis but also the balanced scheduling algorithm presented in Jean-Vivien Millo's thesis. One can generate a posixC file corresponding to the system described in KPassa. The generation of VHDL synthesizable code is ongoing.

An open question:
The balanced scheduling algorithm is applicable to strongly connected graph however, K-PASSA allows simply connected graph. To fill the gap, simply connected graphs are over constrained in strongly connected graphs in a brute force manner. A smarter extension of the balanced scheduling algorithm to simply connected graph is still open.

Last release was on September 25 2013.