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.
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 language | English |
---|---|
Title of host publication | Proceedings of the 1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems |
Publisher | AAAI Press |
Publication date | 2005 |
Publication status | Published - 2005 |
Externally published | Yes |
Event | 1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems - Monterey, United States Duration: 5 Jun 2005 → 10 Jun 2005 Conference number: 1 |
Conference
Conference | 1st ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems |
---|---|
Number | 1 |
Country/Territory | United States |
City | Monterey |
Period | 05/06/2005 → 10/06/2005 |