This is needed since PlusPYr only generates symbolic task graph descriptions but a real execution needs message content information. This is done by a matching processes of communication rules and edges in the task graph. The work here is basically of compiler nature. After the completion of this parser, all the components of the system should be in place, to allow automatic parallelization of affine loop code. The papers about this project are under construction.
Slides are available.
You may also refer to the original PlusPyr and related papers.