Many properties of a Petri net can be determined by analysis of its reachability
graph, such as the existence or optimality of certain paths. The latter
suggests that DP can be applied to solve optimization problems related to Petri
nets. Werner (2006) uses DP to solve a critical path problem arising from a
Petri net model