A Generic Example for Testing Performance of Reachability and Covering Graphs Construction Algorithms.

For the most recent entries see the Petri Nets Newsletter.

A Generic Example for Testing Performance of Reachability and Covering Graphs Construction Algorithms.

Berthelot, G.; Finkel, A.; Johnen, C.; Petrucci, L.

In: Petri Net Newsletter No. 35, pages 6-7. Bonn, Germany: Gesellschaft für Informatik (GI), Special Interest Group on Petri Nets and Related System Models, April 1990.

Keywords: reachability graph; covering graph; performance (of graph construction).

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography