Applying H m heuristics in Petri nets reachability problem

The problem of reachability in Petri nets has several approaches. The technique that produces better results is known as "unfolding". However, the size of the unfolded net can be exponential with respect to the initial Petri net. This work aims to adapt planning heuristics to guide the construction of the unfolding. The article analyzes the use of heuristics, based on a regression of the goal state, in a progressive planner. Several experimental results were generated. They are analyzed and compared with those obtained with other planners already established.