eprintid: 1018
rev_number: 9
eprint_status: archive
userid: 30
dir: disk0/00/00/10/18
datestamp: 2011-11-22 13:39:08
lastmod: 2011-12-20 12:00:25
status_changed: 2011-11-22 13:39:08
type: conference_item
metadata_visibility: show
creators_name: Edelkamp, Stefan
creators_name: Jabbar, Shahid
creators_name: Lluch-Lafuente, Alberto
creators_id: 
creators_id: 
creators_id: alberto.lluch@imtlucca.it
title: Action planning for graph transition systems
ispublished: unpub
subjects: QA75
divisions: CSA
full_text_status: public
pres_type: paper
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.
date: 2005-06
event_title: ICAPS'05 Workshop on verification and validation of model-based planning and scheduling systems
event_location: Monterey, California, USA
event_dates: 5th-10th June 2005
event_type: workshop
refereed: TRUE
official_url: http://planning.cis.strath.ac.uk/vvpsws/Accepted/paper8.pdf
citation:   Edelkamp, Stefan and Jabbar, Shahid and Lluch-Lafuente, Alberto  Action planning for graph transition systems.  In: ICAPS'05 Workshop on verification and validation of model-based planning and scheduling systems, 5th-10th June 2005, Monterey, California, USA       (Unpublished)   (2005)  
document_url: http://eprints.imtlucca.it/1018/1/edelkamp_jabbar_lluch-lafuente2005.pdf