Heuristic Search for the Analysis of Graph Transition Systems

Stefan Edelkamp, Shahid Jabbar, Alberto Lluch Lafuente

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationGraph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 Proceedings
PublisherSpringer Berlin Heidelberg
Publication date2006
ISBN (Print)978-3-540-38870-8
ISBN (Electronic)978-3-540-38872-2
Publication statusPublished - 2006
Externally publishedYes
Event3rd International Conference on Graph Transformation - Rio Grande do Norte, Brazil
Duration: 17 Sept 200623 Sept 2006
Conference number: 3


Conference3rd International Conference on Graph Transformation
CityRio Grande do Norte
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Heuristic Search for the Analysis of Graph Transition Systems'. Together they form a unique fingerprint.

Cite this