| Alternate document: Details Action Planning for Directed Model Checking of Petri Nets (05) Stefan Edelkamp, Shahid Jabbar |
Stefan Edelkamp, Shahid Jabbar, et al.  Home/Search
Context Related
| ls5www.cs.unidor...PlanningForGTS.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: web.tiscali.it/ikaria/alb...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Action Planning for Directed Model Checking of Petri Nets - Edelkamp, Jabbar (2005) (Correct)
Active bibliography (related documents): More All
0.6: Graphical Verification of a Spatial Logic for the π-calculus - Gadducci, Lafuente (2005) (Correct)
0.6: Quantitative μ-calculus and CTL defined over.. - Lluch-Lafuente, Montanari (2005) (Correct)
0.6: Promela Planning - Edelkamp (2003) (Correct)
Similar documents based on text:
5.0: Unknown - (Correct)
BibTeX entry: (Update)
Edelkamp, S., S. Jabbar and A. Lluch-Lafuente, Action planning for graph transition systems, in: International Conference on Automated Planning and Scheduling (ICAPS). Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems, 2005. http://citeseer.ist.psu.edu/edelkamp05action.html More
@misc{ edelkamp05action,
author = "S. Edelkamp and S. Jabbar and A. Lluch-Lafuente",
title = "Action planning for graph transition systems",
text = "Edelkamp, S., S. Jabbar and A. Lluch-Lafuente, Action planning for graph
transition systems, in: International Conference on Automated Planning and
Scheduling (ICAPS). Workshop on Verification and Validation of Model-Based
Planning and Scheduling Systems, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/edelkamp05action.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
891 Strips: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
828 Model Checking - Clarke, Grumberg et al. - 1999
278 Depth-first iterative-deepening: An optimal admissible tree .. (context) - Korf - 1985
178 ADL: Exploring the middleground between STRIPS and situation.. (context) - Pednault - 1989
148 Handbook of graph grammars and computing by graph transforma.. (context) - Rozenberg - 1997
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994
118 A spatial logic for concurrency - Caires, Cardelli - 2003
46 Finding optimal solutions to Rubik's Cube using pattern data.. - Korf - 1997
37 A spatial logic for querying graphs - Cardelli, Gardner et al. - 2002
32 An extension to PDDL for expressing temporal planning domain.. (context) - Fox, Long - 2003
30 Planning as heuristic search - Bonet, Ge - 2001
18 Algebraic approaches to graph transformation (context) - Corradini, Montanari et al. - 1997
16 Directed explicit-state model checking in the validation of .. - Edelkamp, Leue et al. - 2003
13 Algebra and algorithms for QoS path computation and hop-by-h.. - Sobrinho - 2002
12 The arrow distributed directory protocol - Demmer, Herlihy - 2004
9 Planning with pattern databases - Edelkamp - 2001
7 Towards model checking graph grammars (context) - Rensink - 2003
6 Taming numbers and durations in the model checking integrate.. - Edelkamp - 2003
6 Pattern databases (context) - Culberson, Schae - 1998
6 Ignoring the delete list (context) - mann, The et al. - 2003
5 Handbook of graph grammars and computing by graph transforma.. (context) - Courcelle - 1997
5 Promela planning - Edelkamp - 2003
4 Fast plan generation through heuristic search (context) - mann, Nebel - 2001
2 Verifying a behavioural logic for graph transformation syste.. - Baldan, Corradini et al. - 2004
2 Generalizing the relaxed planning heuristic to non-linear ta.. (context) - Edelkamp - 2004
2 Cost-algebraic heuristic search - Edelkamp, Jabbar et al. - 2005
2 Automated formal verification of visual modeling languages b.. (context) - Varro - 2003
1 Graphtransformation als Planungsproblem (context) - Golkov - 2005
1 Towards realistic benchmarks for planning: the domains used .. (context) - mann, Englert et al. - 2005
1 Abstraction databases in theory and model checking practice (context) - Edelkamp, Lluch-Lafuente - 2004
1 Heuristic search for the analysis of graph transition system.. (context) - Edelkamp, Jabbar et al. - 2005
Documents on the same site (http://web.tiscali.it/ikaria/alberto/papers/index.html): More
Quantitative μ-calculus and CTL defined over.. - Lluch-Lafuente, Montanari (2005) (Correct)
Symmetry Reduction and Heuristic Search for Error Detection in.. - Lafuente (Correct)
Graphical Verification of a Spatial Logic for the π-calculus - Gadducci, Lafuente (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC