Petri nets: an introduction
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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.