Action planning for directed model checking of petri nets

Electronic Notes in Theoretical Computer Science

Volumn 149, Issue 2, 2006, Pages 3-18

  Edelkamp, Stefan ^a   Jabbar, Shahid ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Action Planning; Directed Model Checking; PDDL; Petri nets

Indexed keywords

HEURISTIC METHODS; PLANNING; PROBLEM SOLVING;

ACTION PLANNING; PROPERTY VIOLATION; REACHABLE MARKINGS; STATE SPACE;

PETRI NETS;

EID: 31644451516     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.07.023     Document Type: Conference Paper

References (36)

1. F. Bacchus, and F. Kabanza Using temporal logics to express search control knowledge for planning Artificial Intelligence 116 2000 123 191
2. G. Berthelot Checking properties of nets using transformations Advances in Petri Nets 1985 LNCS 222 1985 19 40
3. G. Berthelot Transformations and decompositions of nets Advances in Petri nets 1986 LNCS 254 1987 359 376
4. B. Bonet, and H. Geffner Planning as heuristic search Artificial Intelligence 129 2001 5 33
5. T. Bylander The computational complexity of propositional STRIPS planning Artificial Intelligence 1994 165 204
6. Cimatti, A., E. Giunchiglia, F. Giunchiglia and P. Traverso, Planning via model checking: A decision procedure for AR, in: European Conference on Planning (ECP), 1997, pp. 130-142
7. Cimatti, A. and M. Roveri, Conformant planning via model checking, in: European Conference on Planning (ECP), 1999, pp. 21-33
8. Cimatti, A., M. Roveri and P. Traverso, Automatic OBDD-based generation of universal plans in non-deterministic domains, in: National Conference on Artificial Intelligence (AAAI), 1998, pp. 875-881
9. E. Clarke, O. Grumberg, and D. Peled Model Checking 1999 The MIT Press
10. J. Corbett Evaluating deadlock detection methods for concurrent software IEEE Transactions on Software Engineering 22 1996 161 180
11. J.C. Culberson, and J. Schaeffer Pattern databases Computational Intelligence 14 1998 318 334
12. Edelkamp, S., Planning with pattern databases, in: European Conference on Planning (ECP), 2001, pp. 13-24
13. Edelkamp, S., Promela planning, in: Workshop on Model Checking Software (SPIN), 2003
14. S. Edelkamp Taming numbers and durations in the model checking integrated planning system Journal of Artificial Research (JAIR) 20 2003 195 238
15. Edelkamp, S., Generalizing the relaxed planning heuristic to non-linear tasks, in: German Conference on Artificial Intelligence (KI), 2004, 198-212
16. S. Edelkamp, and J. Hoffmann The classical part of ipc-4: An Overview Journal of Artificial Research 2005 special Track on the 4th International Planning Competition
17. 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
18. Edelkamp, S., S. Jabbar and A. Lluch-Lafuente, Cost-algebraic heuristic search, in: National Conference on Artificial Intelligence (AAAI) (2005), pp. 1362-1367
19. S. Edelkamp, S. Leue, and A.L. Lafuente Directed explicit-state model checking in the validation of communication protocols International Journal on Software Tools for Technology Transfer (STTT) 5 2003 247 267
20. Edelkamp, S. and A. Lluch-Lafuente, Abstraction in directed model checking, in: ICAPS-Workshop on Connecting Planning Theory with Practice, 2004
21. Fabiani, P. and Y. Meiller, Planning with tokens: an approach between satisfaction and optimisation, in: European Conference on Artificial Intelligence. Workshop "New Results in Planning, Scheduling and Design", 2000
22. R. Fikes, and N. Nilsson Strips: A new approach to the application of theorem proving to problem solving Artificial Intelligence 2 1971 189 208
23. M. Fox, and D. Long PDDL2.1: An extension to PDDL for expressing temporal planning domains Journal of Artificial Research 2003 special issue on the 3rd International Planning Competition
24. Heljanko, K. and I. Niemelä, Answer set programming and bounded model checking, in: AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, 2001, pp. 90-96
25. J. Hoffmann The Metric FF planning system: Translating "Ignoring the delete list" to numerical state variables Journal of Artificial Intelligence Research 20 2003 291 341
26. Hoffmann, J., R. Englert, F. Liporace, S. Thiebaux and S. Trüg, Engineering benchmarks for planning: The domains used in the classical part of IPC-4 (2005), draft
27. J. Hoffmann, and B. Nebel Fast plan generation through heuristic search Journal of Artificial Intelligence Research (JAIR) 14 2001 253 302
28. G. Holzmann The Spin Model Checker: Primer and Reference Manual 2003 Addison-Wesley
29. F. Kabanza, M. Barbeau, and R. St-Denis Planning control rules for reachtive agents Artificial Intelligence 95 1997 67 113
30. Kvarnström, J., P. Doherty and P. Haslum, Extending TALplanner with concurrency and ressources, in: European Conference on Artificial Intelligence (ECAI), 2000, pp. 501-505
31. Melzer, S. and S. Römer, Deadlock checking using net unfoldings, in: International Conference on Computer Aided Verification (CAV), 1997, pp. 172-183
32. J. Pearl Heuristics 1985 Addison-Wesley
33. Pednault, E. P. D., ADL: Exploring the middleground between STRIPS and situation calculus, in: Knowledge Representation and Reasoning (KR) (1989), pp. 324-332
34. Petri, C. A., "Kommunikation mit Automaten," Ph.D. thesis, Universität Bonn (1962)
35. Pistore, M. and P. Traverso, Planning as model checking for extended goals in non-deterministic domains, in: International Joint Conference on Artificial Intelligence (IJCAI), 2001, pp. 479-486
36. S. Russell, and P. Norvig Artificial Intelligence: A Modern Approach 2003 Prentice Hall