  Solutions proposed for the longstanding problem of automatic decomposition of
Petri nets into concurrent processes, as well as methods developed in Grenoble
for the automatic conversion of safe Petri nets to NUPNs (Nested-Unit Petri
Nets), require certain properties to be computed on Petri nets. We notice that,
although these properties are theoretically interesting and practically useful,
they are not currently implemented in mainstream Petri net tools. Taking into
account such properties would open fruitful research directions for tool
developers, and new perspectives for the Model Checking Contest as well.
