Combining Finkel's and Jensen's Reduction Techniques to Build Covering Trees for Coloured Nets.

For the most recent entries see the Petri Nets Newsletter.

Combining Finkel's and Jensen's Reduction Techniques to Build Covering Trees for Coloured Nets.

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

Also as: Research Report CEDRIC. Centre d'Etudes et de Recherche en Informatique du Conservatoire National des Arts et Métiers, Paris, France, January 1991. Changed title: Smaller Covering Trees for Coloured Nets and Semi-Covering Trees for Algebraic Nets.

Keywords: covering tree (for) coloured net.

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

Back to the Petri Nets Bibliography