TY  - UNPB
M2  - Monterey, California, USA
AV  - public
TI  - Action planning for graph transition systems
N2  - 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.
ID  - eprints1018
A1  - Edelkamp, Stefan
A1  - Jabbar, Shahid
A1  - Lluch-Lafuente, Alberto
UR  - http://planning.cis.strath.ac.uk/vvpsws/Accepted/paper8.pdf
Y1  - 2005/06//
T2  - ICAPS'05 Workshop on verification and validation of model-based planning and scheduling systems
ER  -