Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacchus, F.: The aips 2000 planning competition. AI Magazine 22(3), 47–56 (2001)
Esparza, J., Römer, S., Vogler, W.: An improvement of mcmillan’s unfolding algorithm. In: Formal Methods in System Design, pp. 87–106. Springer, Heidelberg (1996)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning - theory and practice, 1st edn. Morgan Kaufmann, San Francisco (2004)
Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, pp. 140–149. AAAI Press, Menlo Park (2000)
Hickmott, S., Rintanen, J., Thi’ebaux, S., White, L.: Planning via petri net unfolding. Technical report. In: ECAI-Workshop on Model Checking and Artificial Intelligence (2006)
Kaunts, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference of Artificial Inteligente (ECAI 1992), pp. 359–363 (1992)
Kultz, R., Künzle, L.A.: Utilização de heurísticas de planejamento no desdobramento de redes de petri. Master’s thesis, Universidade Federal do Paraná (2010)
Long, D., Fox, M.: The 3rd international planning competition: Results and analysis. J. Artif. Intell. Res. (JAIR) 20, 1–59 (2003)
Mcmillan, K.L., Probst, D.K.: A technique of state space search based on unfolding. In: Formal Methods in System Design, pp. 45–65 (1992)
Reisig, W.: Petri Nets - An Introduction. Springer, Heidelberg (1985)
Russell, S., Norvig, P.: Artificial Intelligence - A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2003)
Schwoon, S., Römer, S.: Mole - an unfolder for low-level petri nets (2004), Free software under GPL licence, http://www.fmi.uni-stuttgart.de/szs/tools/mole/mole-060323.tar.gz
Töws, G.S., Silva, F.: Petrigraph: um algoritmo para planejamento por desdobramento de redes de petri. Master’s thesis, Universidade Federal do Paraná (2008)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kultz, R., Künzle, L.A., Silva, F. (2010). Applying Hm Heuristics in Petri Nets Reachability Problem. In: Kuri-Morales, A., Simari, G.R. (eds) Advances in Artificial Intelligence – IBERAMIA 2010. IBERAMIA 2010. Lecture Notes in Computer Science(), vol 6433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16952-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-16952-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16951-9
Online ISBN: 978-3-642-16952-6
eBook Packages: Computer ScienceComputer Science (R0)