TY  - CHAP
M1  - 4178
N2  - 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.
SN  - 3-540-38870-2
UR  - http://dx.doi.org/10.1007/11841883_29
AV  - public
TI  - Heuristic Search for the Analysis of Graph Transition Systems
T2  - Graph Transformations (ICGT 2006)
EP  - 429
N1  - © Springer-Verlag Berlin Heidelberg 2006. The original publication is available at www.springerlink.com.
ID  - eprints157
T3  - Lecture Notes in Computer Science
SP  - 414
A1  - Edelkamp, Stefan
A1  - Jabbar, Shahid
A1  - Lluch-Lafuente, Alberto
PB  - Springer
Y1  - 2006///
ED  - Corradini, Andrea
ED  - Ehrig, Hartmut
ED  - Montanari, Ugo
ED  - Ribeiro, Leila
ED  - Rozenberg, Grzegorz
ER  -