1 citations · 1 across the 1 of their papers we have counts for
1 paper
Renaud Sirdey, Pascal Aubry
In this paper, we present linear programming-based sufficient conditions, some of them polynomial-time, to establish the liveness and memory boundedness of general dataflow process…