@incollection{eprints157,
           pages = {414--429},
          volume = {4178},
            year = {2006},
          series = {Lecture Notes in Computer Science},
           title = {Heuristic Search for the Analysis of Graph Transition Systems},
          author = {Stefan Edelkamp and Shahid Jabbar and Alberto Lluch-Lafuente},
            note = {{\copyright} Springer-Verlag Berlin Heidelberg 2006. The original publication is available at www.springerlink.com.},
       publisher = {Springer},
       booktitle = {Graph Transformations (ICGT 2006)},
          editor = {Andrea Corradini and Hartmut Ehrig and Ugo Montanari and Leila Ribeiro and Grzegorz Rozenberg},
             url = {http://eprints.imtlucca.it/157/},
        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. 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.}
}