%T Heuristic Search for the Analysis of Graph Transition Systems
%P 414-429
%V 4178
%I Springer
%O ? Springer-Verlag Berlin Heidelberg 2006. The original publication is available at www.springerlink.com.
%D 2006
%L eprints157
%E Andrea Corradini
%E Hartmut Ehrig
%E Ugo Montanari
%E Leila Ribeiro
%E Grzegorz Rozenberg
%X 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. Heuristic search is a successful Artificial Intelligence technique for solving exploration problems implicitly present in games, planning, and formal verification. Heuristic search exploits information about the problem being solved to guide the exploration process. The main benefits are significant reductions in the search effort and the size of solutions. We propose the application of heuristic search for the analysis of graph transition systems. We define algorithms and heuristics and present experimental results.
%A Stefan Edelkamp
%A Shahid Jabbar
%A Alberto Lluch-Lafuente
%S Lecture Notes in Computer Science
%R 10.1007/11841883_29
%B Graph Transformations (ICGT 2006)