Action Planning for Graph Transition Systems

Stefan Edelkamp, Shahid Jabbar, Alberto Lluch Lafuente

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication,
object orientation, concurrency, mobility and distribution. State spaces of such systems can be represented by graph transition systems, which are basically transition systems whose states and transitions represent graphs and graph morphisms. In this paper, we propose the modeling of graph transition systems in PDDL and the application of heuristic search planning for their analysis. We consider different heuristics and present experimental results.
Original languageEnglish
Title of host publicationProceedings of the 1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems
PublisherAAAI Press
Publication date2005
Publication statusPublished - 2005
Externally publishedYes
Event1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems - Monterey, CA, United States
Duration: 5 Jun 200510 Jun 2005
Conference number: 1

Conference

Conference1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems
Number1
CountryUnited States
CityMonterey, CA
Period05/06/200510/06/2005

Cite this

Edelkamp, S., Jabbar, S., & Lluch Lafuente, A. (2005). Action Planning for Graph Transition Systems. In Proceedings of the 1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems AAAI Press.