In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 433-452. Berlin, Germany: Springer-Verlag, 1990.
Abstract: Complementary heuristics are stated to improve the performances of the Farkas algorithm which is used for the computation of a set of generators of positive semi-flows with minimal support on P/T nets. The purpose of the paper concerns a comparative study by means of examples about the performances in these heuristics. It is shown that the heuristics lead sometimes to notable improvements of the Farkas algorithm performance and allow, due to the data structure implemented, the analysis of nets whose size may be arbitrary large.
Keywords: semi-flow computation; place/transition net; Farkas algorithm performance.