Heuristic search for the analysis of graph transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4178 LNCS, Issue , 2006, Pages 414-429

  Edelkamp, Stefan ^a   Jabbar, Shahid ^a   Lafuente, Alberto Lluch ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b NONE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INFORMATION THEORY; MATHEMATICAL MODELS;

FORMAL VERIFICATION; GRAPH TRANSITION; HEURISTIC SEARCH;

GRAPH THEORY;

EID: 33750251161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841883_29     Document Type: Conference Paper

References (34)

1. P. Baldan, A. Corradini, B. König, and B. König. Verifying a behavioural logic for graph transformation systems. In CoMeta'03, ENTCS, 2004.
2. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
3. L. Caires and L. Cardelli. A spatial logic for concurrency (part I). Inf. Comput., 186(2):194-235, 2003.
4. L. Cardelli, P. Gardner, and G. Ghelli. A spatial logic for querying graphs. In ICALP, volume 2380, pages 597-610, 2002.
5. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
7. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation, volume 1, chapter Basic concepts and double push-out approach. World Scientific, 1997.
8. B. Courcelle. Handbook of graph grammars and computing by graph transformations, volume 1 : Foundations, chapter 5, pages 313-400. World Scientific, 1997.
9. M. J. Demmer and M. Herlihy. The arrow distributed directory protocol. In DISC, pages 119-133, 1998.
10. S. Edelkamp. Planning with pattern databases. In ECP, 2001. 13-24.
11. S. Edelkamp. Taming numbers and durations in the model checking integrated planning system. JAIR, 20:195-238, 2003.
12. S. Edelkamp, S. Jabbar, and A. Lluch Lafuente. Cost-algebraic heuristic search. In AAAI, pages 1362-1367, 2005.
13. S. Edelkamp, S. Leue, and A. Lluch Lafuente. Directed explicit-state model checking in the validation of communication protocols. STTT, 5(2-3):247-267, 2003.
14. S. Edelkamp and A. Lluch Lafuente. Abstraction databases in theory and model checking practice. In ICAPS Workshop on Connecting Planning Theory with Practice, 2004.
15. F. Gadducci and A. Lluch Lafuente. Graphical verification of a spatial logic for the pi-calculus. In Graph Transformation for Verification and Concurrency. ENTCS, 2005. to appear.
16. A. Groce and W. Visser. Model checking Java programs using structural heuristics. In ISSTA. ACM Press, 2002.
17. S. Gyapay, Á. Schmidt, and D. Varró. Joint optimization and reachability analysis in graph transformation systems with time. In GT-VMT, volume 109 of ENTCS, pages 137-147. Elsevier, 2004.
18. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on Systems Science and Cybernetics, 4:100-107, 1968.
19. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with Blast. In SPIN, pages 235-239, 2003.
20. D. Hirsch, A. Lluch Lafuente, and E. Tuosto. A logic for application level QoS. In Proceedings of the 3rd Workshop on Quantitative Aspects of Programming Languages.
21. J. Hoffmann and B. Nebel. Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
22. G. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
23. H. Kastenberg and A. Rensink. Model checking dynamic states in GROOVE. In SPIN, pages 299-305, 2006.
24. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
25. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1-35, 1995.
26. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
27. J. Pearl. Heuristics. Addison-Wesley, 1985.
28. A. Rensink. Towards model checking graph grammars. In Automated Verification of Critical Systems, Tech. Report DSSE-TR-2003, pages 150-160, 2003.
29. A. Rensink. Time and space issues in the generation of graph transition systems. In GraBaTs, volume 127 of ENTCS, pages 127-139. Elsevier, 2005.
30. A. Rensink and D. Distefano. Abstract graph transformation. In SVV, ENTCS, 2005. To appear.
31. G. Rozenberg, editor. Handbook of graph grammars and computing by graph transformations. World Scientific, 1997.
32. J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. IEEE/ACM Trans. Netw., 10(4):541-550, 2002.
33. D. Varrò. Automated formal verification of visual modeling languages by model checking. Journal on Software and Systems Modeling, 2003.
34. I. Wegener. Komplexitätstheorie. Springer, 2003. (in German).